The Community for Technology Leaders
Proceedings of IEEE 36th Annual Foundations of Computer Science (1995)
Milwaukee, Wisconsin
Oct. 23, 1995 to Oct. 25, 1995
ISSN: 0272-5428
ISBN: 0-8186-7183-1
pp: 52
J. Kzeinberg , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
E. Tardos , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
We consider the following maximum disjoint paths problem (MDPP). We are given a large network, and pairs of nodes that wish to communicate over paths through the network-the goal is to simultaneously connect as many of these pairs as possible in such a way that no two communication paths share an edge in the network. This classical problem has been brought into focus recently in papers discussing applications to routing in high-speed networks, where the current lack of understanding of the MDPP is an obstacle to the design of practical heuristics. We consider the class of densely embedded, nearly-Eulerian graphs, which includes the two-dimensional mesh and other planar and locally planar interconnection networks. We obtain a constant-factor approximation algorithm for the maximum disjoint paths problem for this class of graphs; this improves on an O(log n)-approximation for the special case of the two-dimensional mesh due to Aumann-Rabani and the authors. For networks that are not explicitly required to be "high-capacity," this is the first constant-factor approximation for the MDPP in any class of graphs other than trees. We also consider the MDPP in the on-line setting, relevant to applications in which connection requests arrive over time and must be processed immediately. Here we obtain an asymptptically optimal O(log n)competitive on-line algorithm for the same class of graphs; this improves on an O(log n log log n) competitive algorithm for the special case of the mesh due to B. Awerbuch et al (1994).
multiprocessor interconnection networks; trees (mathematics); operations research; computational geometry; disjoint paths; densely embedded graphs; communication paths; routing; high-speed networks; heuristics; nearly-Eulerian graphs; two-dimensional mesh; locally planar interconnection networks; constant-factor approximation algorithm; maximum disjoint paths; on-line setting

J. Kzeinberg and E. Tardos, "Disjoint paths in densely embedded graphs," Proceedings of IEEE 36th Annual Foundations of Computer Science(FOCS), Milwaukee, Wisconsin, 1995, pp. 52.
94 ms
(Ver 3.3 (11022016))