Approximation algorithms for routing and call scheduling in all-optical chains and rings

Author： Becchetti L.   Di Ianni M.   Marchetti-Spaccamela A.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.287, Iss.2, 2002-09, pp. : 429-448

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On-line routing in all-optical networks

By Bartal Y.   Leonardi S.  

Theoretical Computer Science, Vol. 221, Iss. 1, 1999-06 ,pp. : 19-39

Elsevier

Access to resources Recommend Favorite

Approximation Algorithms for Scheduling with Reservations

By Diedrich Florian   Jansen Klaus   Pascual Fanny   Trystram Denis  

Algorithmica, Vol. 58, Iss. 2, 2010-10 ,pp. : 391-404

Springer Publishing Company

Access to resources Recommend Favorite

Bicriteria approximation algorithms for scheduling problems with communications delays

By Bampis Evripidis   Kononov Alexander  

Journal of Scheduling, Vol. 8, Iss. 4, 2005-07 ,pp. : 281-294

Springer Publishing Company

Access to resources Recommend Favorite

Approximation Algorithms for Average Stretch Scheduling: Special Issue on Scheduling

By Bender Michael A.   Muthukrishnan S.   Rajaraman Rajmohan  

Journal of Scheduling, Vol. 7, Iss. 3, 2004-05 ,pp. : 195-222

Springer Publishing Company

Access to resources Recommend Favorite

Scheduling algorithms and routing structures for efficient convergecast in wireless sensor networks

By Lai Nai-Luen   Lin Chun-Han   King Chung-Ta  

International Journal of Pervasive Computing and Communications, Vol. 6, Iss. 1, 2010-01 ,pp. : 4-18

Emerald Group Publishing Ltd

Access to resources Recommend Favorite