Data structures and network algorithms
Data structures and network algorithms
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
On the k-coloring of intervals
Discrete Applied Mathematics
Efficient routing in optical networks
Journal of the ACM (JACM)
On-line call admission for high-speed networks
On-line call admission for high-speed networks
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Methods and Problems of Wavelength-Routing in All-Optical Networks
Methods and Problems of Wavelength-Routing in All-Optical Networks
Approximation algorithms for disjoint paths problems
Approximation algorithms for disjoint paths problems
Approximation strategies for routing edge disjoint paths in complete graphs
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Approximation algorithms for edge-disjoint paths and unsplittable flow
Efficient Approximation and Online Algorithms
| Hi-index | 0.00 |
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,ev en 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.