Abstract
Path problems such as the maximum edge-disjoint paths problem, the path coloring problem, and the maximum path coloring problem are relevant for resource allocation in communication networks, in particular all-optical networks. In this paper, it is shown that maximum path coloring can be solved optimally in polynomial time for bidirected generalized stars, even in the weighted case. Furthermore, the maximum edge-disjoint paths problem is proved NP-hard for complete graphs (undirected or bidirected), and a constant-factor approximation algorithm is presented. Finally, an open problem concerning the existence of routings that simultaneously minimize the maximum load and the number of colors is solved: an example for a graph and a set of requests is given such that any routing that minimizes the maximum load requires strictly more colors for path coloring than a routing that minimizes the number of colors.
Research partially supported by the Swiss National Science Foundation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
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.
M. C. Carlisle and E. L. Lloyd. On the k-coloring of intervals. Discrete Appl. Math., 59:225–235, 1995.
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, PA, October 1995.
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.
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.
L. Gargano and U. Vaccaro. Routing in all-optical networks: Algorithmic and graph-theoretic problems. In I. Althöfer et al., editors, Numbers, Information and Complexity, pages 555–578. Kluwer Academic Publishers, 2000.
M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, Berlin, 1988.
V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, and M. Yannakakis. Near-optimal 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.
R. Klasing. Methods and problems of wavelength-routing in all-optical networks. Technical Report CS-RR-348, Department of Computer Science, University of Warwick, September 1998. Presented as invited talk at the MFCS’98 Workshop on Communications.
J. Kleinberg. Approximation algorithms for disjoint paths problems. PhD thesis, MIT, 1996.
C. E. Shannon. A theorem on coloring lines of a network. J. Math. Phys., 28:148–151, 1949.
R. E. Tarjan. Data structures and network algorithms. SIAM, Philadelphia, PA, 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Erlebach, T., Vukadinović, D. (2001). New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs. In: Freivalds, R. (eds) Fundamentals of Computation Theory. FCT 2001. Lecture Notes in Computer Science, vol 2138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44669-9_55
Download citation
DOI: https://doi.org/10.1007/3-540-44669-9_55
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42487-1
Online ISBN: 978-3-540-44669-9
eBook Packages: Springer Book Archive