New results for path problems in generalized stars, complete graphs, Brick wall graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2138, Issue , 2001, Pages 483-494

  Erlebach, Thomas ^a   Vukadinović, Danica ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COLOR; COMPUTATION THEORY; OPTICAL COMMUNICATION; POLYNOMIAL APPROXIMATION; STARS;

ALL- OPTICAL NETWORKS; COMPLETE GRAPHS; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; EDGE DISJOINT PATHS; MAXIMUM LOAD; PATH COLORINGS; PATH PROBLEMS; POLYNOMIAL-TIME;

GRAPH THEORY;

EID: 84974668326     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44669-9_55     Document Type: Conference Paper

References (14)

1. A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, and M. Sudan. Efficient routing in optical networks. Journal of the ACM, 46(6):973-1001, November 1996.
2. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
3. B. Beauquier, J.-C. Bermond, L. Gargano, P. Hell, S. Perennes, and U. Vaccaro. Graph problems arising from wavelength-routing in all-optical networks. In Proceedings of IPPS’97, Second Workshop on Optics and Computer Science (WOCS), 1997.
4. M. C. Carlisle and E. L. Lloyd. On the k-coloring of intervals. Discrete Appl. Math., 59:225–235,1995.
5. A. Feldmann. On-line call admission for high-speed networks (Ph.D. Thesis). Technical Report CMU-CS-95-201, School of Computer Science, Carnegie Mellon University, Pittsburgh, P A, Octob er 1995.
6. M. R. Garey and D. S. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.
7. L. Gargano, P. Hell, and S. Perennes. Colouring paths in directed symmetric trees with applications to WDM routing. In Proceedings of the 24th International Colloquium on Automata, Languages and Programming ICALP’97, LNCS 1256, pages 505–515,1997.
8. L. Gargano and U. Vaccaro. Routing in all-optical networks: Algorithmic and graph-theoretic problems. In I. Althöer et al., editors, Numbers, Information and Complexity, pages 555–578. Kluwer Academic Publishers, 2000.
9. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, Berlin, 1988.
10. V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, and M. Yannakakis. Nearoptimal hardness results and approximation algorithms for edge-disjoint paths and related problems. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing STOC’99, pages 19–28,1999.
11. R. Klasing. Methods and problems of wavelength-routing in all-optical networks. Technical Report CS-RR-348, Departmen t of Computer Science, University of Warwick, Septem ber 1998. Presented as invited talk at the MFCS’98 Workshop on Communications.
12. J. Kleinberg. Approximation algorithms for disjoint paths problems. PhD thesis, MIT, 1996.
13. C. E. Shannon. A theorem on coloring lines of a network. J. Math. Phys.,28:148–151, 1949.
14. R. E. Tarjan. Data structures and network algorithms. SIAM, Philadelphia, P A, 1983.