The Maximum Edge-Disjoint Paths Problem in Bidirected Trees

A bidirected tree is the directed graph obtained from an undirected tree by replacing each undirected edge by two directed edges with opposite directions. Given a set of directed paths in a bidirected tree, the goal of the maximum edge-disjoint paths problem is to select a maximum-cardinality subset of the paths such that the selected paths are edge-disjoint. This problem can be solved optimally in polynomial time for bidirected trees of constant degree but is APX-hard for bidirected trees of arbitrary degree. For every fixed $\varepsilon >0$, a polynomial-time $(5/3+\varepsilon)$-approximation algorithm is presented.

[1]  Satish Rao,et al.  Efficient access to optical bandwidth , 1995, FOCS 1995.

[2]  Christos Kaklamanis,et al.  Efficient Wavelength Routing on Directed Fiber Trees , 1996, ESA.

[3]  Viggo Kann,et al.  Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete , 1991, Inf. Process. Lett..

[4]  Klaus Jansen,et al.  Call scheduling in trees, rings and meshes , 1997, Proceedings of the Thirtieth Hawaii International Conference on System Sciences.

[5]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[6]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[7]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[8]  Stéphane Pérennes,et al.  Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing , 1997, ICALP.

[9]  Yuval Rabani,et al.  On-line admission control and circuit routing for high performance computing and communication , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[10]  Uzi Vishkin,et al.  On Finding Lowest Common Ancestors: Simplification and Parallelization , 1988, AWOC.

[11]  Venkatesan Guruswami,et al.  Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 1999, STOC '99.

[12]  Klaus Jansen,et al.  Optimal Wavelength Routing on Directed Fiber Trees , 1999, Theor. Comput. Sci..

[13]  Amos Fiat,et al.  Competitive non-preemptive call control , 1994, SODA '94.

[14]  Jon M. Kleinberg,et al.  Approximation algorithms for disjoint paths problems , 1996 .

[15]  Éva Tardos,et al.  Disjoint paths in densely embedded graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[16]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[17]  Peng-Jun Wan,et al.  Maximal throughput in wavelength-routed optical networks , 1998, Multichannel Optical Networks: Theory and Practice.

[18]  Ioannis Caragiannis,et al.  Randomized path coloring on binary trees , 2000, Theor. Comput. Sci..

[19]  Klaus Jansen,et al.  Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees , 2000, Algorithm Engineering.

[20]  Vijay Kumar,et al.  Improved access to optical bandwidth in trees , 1997, SODA '97.

[21]  Klaus Jansen,et al.  An optimal greedy algorithm for wavelength allocation in directed tree networks , 1997, Network Design: Connectivity and Facilities Location.

[22]  George L. Nemhauser,et al.  Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .

[23]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[24]  Luca Trevisan,et al.  Structure in Approximation Classes , 1999, Electron. Colloquium Comput. Complex..

[25]  Clifford Stein,et al.  Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs ( Extended Abstract ) , 1998 .

[26]  Klaus Jansen,et al.  Conversion of coloring algorithms into maximum weight independent set algorithms , 2005, Discret. Appl. Math..

[27]  Alexander Russell,et al.  A Note on Optical Routing on Trees , 1997, Inf. Process. Lett..

[28]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[29]  Klaus Jansen,et al.  The complexity of path coloring and call scheduling , 2001, Theor. Comput. Sci..

[30]  Aravind Srinivasan,et al.  Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[31]  Mihalis Yannakakis,et al.  Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.

[32]  G. Tinhofer.  Graphen und Matrizen , 1976 .