The maximum edge-disjoint paths problem in bidirected trees

SIAM Journal on Discrete Mathematics

Volumn 14, Issue 3, 2001, Pages 326-355

  Erlebach, Thomas ^a   Jansen, Klaus ^b  

^a ETH ZURICH   (Switzerland)

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

Approximation algorithms; Bidirected trees; Edge disjoint paths

Indexed keywords

EID: 0042921146     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480199361259     Document Type: Article

References (31)

1. V. AULETTA, I. CARAGIANNIS, C. KAKLAMANIS, AND P. PERSIANO, Randomized path coloring on binary trees, in Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 2000), Lecture Notes in Comput. Sci. 1913, Springer-Verlag, Berlin, 2000, pp. 60-71.
2. G. AUSIELLO, P. CRESCENZI, G GAMBOSI, V. KANN, A. MARCHETTI-SPACCAMELA, AND M. PROTASI, Complexity and Approximation. Combinatorial Optimization Problems and Their Approximability Properties, Springer-Verlag, Berlin, 1999.
3. B. AWERBUCH, Y. AZAR, A FIAT, S. LEONARDI, AND A. ROSÉN, On-line competitive algorithms for call admission m optical networks, Algorithmica, 31 (2001), pp. 29-43.
4. B. AWERBUCH, Y. BARTAL, A. FIAT, AND A. ROSÉN, Competitive non-preemptive call control, in Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'94), Arlington. VA, 1994, pp. 312-320.
5. B. AWERBUCH, R. GAWLICK, T. LEIGHTON, AND Y RABANI, On-line admission control and circuit routing for high performance computing and communication, in Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS'94), Santa Fe, NM, 1994, pp. 412-423.
6. C. BERGE, Graphs and Hypergraphs, 2nd ed., North-Holland, Amsterdam, 1976.
7. N. K. CHEUNG, K. NOSU AND G WINZER, EDS, Dense Wavelength Division Multiplexing Techniques for High Capacity and Multiple Access Communication Systems, IEEE Journal on Selected Areas in Communications, vol. 8. no. 6, IEEE Communications Society, New York, 1990, special issue.
8. G. CORNUEJOLS, M. L. FISHER, AND G. L. NEMHAUSER, Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms, Management Sci., 23 (1977), pp. 789-810.
9. T. ERLEBACH AND K. JANSEN, Conversion of coloring algorithms into maximum weight independent set algorithms, in ICALP Workshops 2000, Proceedings in Informatics 8, Carleton Scientific, Ontario, Canada, 2000, pp. 135-145.
10. T. ERLEBACH AND K. JANSEN, Implementation of approximation algorithms for weighted and unweighted edge-disjoint paths in bidirected trees, in Proceedings of the 4th Workshop on Algorithm Engineering (WAE 2000), Saarbrücken, Germany, 2000.
11. T. ERLEBACH AND K. JANSEN, The complexity of path coloring and call scheduling, Theoret. Comput. Sci., 255 (2001), pp. 33-50.
12. T. ERLEBACH, K. JANSEN, C. KAKLAMANIS, M. MIHAIL, AND P. PERSIANO, Optimal wavelength routing on directed fiber trees, Theoret. Comput. Sci., 221 (1999), pp. 119-137.
13. T. ERLEBACH, K. JANSEN, C. KAKLAMANIS, AND P. PERSIANO, An optimal greedy algorithm for wavelength allocation in directed tree networks, in Proceedings of the DIMACS Workshop on Network Design: Connectivity and Facilities Location, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 40, AMS, Providence, RI, 1998, pp. 117-129.
14. A. FRANK, Packing paths, circuits, and cuts - a survey, in Paths, Flows, and VLSI-Layout, B. Korte, L. Lovász, H. J. Prömel, and A. Schrijver, eds., Springer-Verlag, Berlin, 1990, pp. 47-100.
15. N. GARG, V. V VAZIRANI, AND M. YANNAKAKIS, Primal-dual approximation algorithms for integral flow and multicut in trees, Algorithmica, 18 (1997), pp. 3-20
16. 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), Lecture Notes in Comput. Sci. 1256, Springer-Verlag, Berlin, 1997, pp. 505-515.
17. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag. Berlin, 1988.
18. 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), Atlanta, GA, 1999, pp. 19-28.
19. 5/2 algorithm for maximum matchings in bipartite graphs, SIAM J. Comput., 2 (1973), pp. 225-231.
20. C. KAKLAMANIS AND P. PERSIANO, Efficient wavelength routing on directed fiber trees, in Proceedings of the 4th Annual European Symposium on Algorithms (ESA'96), Lecture Notes in Comput. Sci. 1136, Springer-Verlag, Berlin, 1996, pp. 460-470.
21. V. KANN, Maximum bounded 3-dimensional matching is MAX SNP-complete, Inform. Process. Lett., 37 (1991), pp. 27-35.
22. J. KLEINBERG, Approximation Algorithms for Disjoint Paths Problems, Ph.D. thesis, Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA, 1996.
23. J. KLEINBERG AND É. TARDOS, Disjoint paths in densely embedded graphs, in Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95), Milwaukee, WI, 1995, pp. 52-61.
24. S. G. KOLLIOPOULOS AND C. STEIN, Approximating disjoint-path problems using greedy algorithms and packing integer programs, in Proceedings of the 6th Integer Programming and Combinatorial Optimization Conference (IPCO VI), Lecture Notes in Comput. Sci. 1412, Springer-Verlag, Berlin, 1998, pp. 153-168.
25. D. KÖNIG, Graphen und Matrizen, Mat. Fiz. Lapok, 38 (1931), pp. 116-119.
26. S. R. KUMAR, R. PANIGRAHY, A. RÜSSEL, AND R SUNDARAM, A note, on optical routing on trees, Inform. Process. Lett., 62 (1997), pp. 295-300.
27. V. KUMAR AND E. J. SCHWABE, Improved access to optical bandwidth in trees, in Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'97), New Orleans, LA, 1997, pp. 437-444.
28. M. MIHAIL, C. KAKLAMANIS, AND S. RAO, Efficient access to optical bandwidth, in Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95), Milwaukee, WI, 1995, pp. 548-557.
29. B. SCHIEBER AND U. VISHKIN, On finding lowest common ancestors: Simplification and parallelization, SIAM J. Comput., 17 (1988), pp. 1253-1262.
30. A. SRINIVASAN, Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems, in Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS'97), Miami Beach, FL, 1997, pp. 416-425.
31. P.-J. WAN AND L. LIU, Maximal throughput in wavelength-routed optical networks, in Multi-channel Optical Networks: Theory and Practice, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 46, AMS, Providence, RI, 1998, pp. 15-26.