An approximation algorithm for the disjoint paths problem in even-degree planar graphs

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2005, Issue , 2005, Pages 627-636

  Kleinberg, Jon ^a  

^a School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISJOINT PATHS PROBLEM; POLYLOGARITHMIC APPROXIMATION; ROUTING PROBLEMS;

ALGORITHMS; COMPUTATIONAL METHODS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; ROUTERS;

GRAPH THEORY;

EID: 33748628520     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2005.18     Document Type: Conference Paper

References (35)

1. N. Alon, P. Seymour, R. Thomas. "Planar separators," SIAM J. Discrete Math. 7 (1994) 184-193
2. M. Andrews, L. Zhang. "Hardness of the undirected edge-disjoint paths problem." Proc. 37th ACM Symp. on Theory of Computing 2005.
3. Y. Aumann, Y. Rabani, "Improved bounds for all-optical routing," Proc. 6th ACM-SIAM Symp. on Discrete Algorithms, 1995, pp. 567-576.
4. B. Awerbuch, R. Gawlick, F.T. Leighton, Y. Rabani, "On-line admission control and circuit routing for high performance computing and communication," Proc. 35th IEEE Symp. on Foundations of Computer Science, 1994, pp. 412-423.
5. A. Broder, A. Frieze, E. Upfal, "Existence and construction of edge-disjoint paths on expander graphs," SIAM J. Computing, 23(1994), pp. 976-989.
6. C. Chekuri, S. Khanna, B. Shepherd, "The All-or-Nothing Multicommodity Flow Problem," Proc. 36th ACM Symp. on Theory of Computing, 2004.
7. C. Chekuri, S. Khanna, B. Shepherd, "Edge-disjoint paths in planar graphs," Proc. 45th IEEE Symp. on Foundations of Computer Science, 2004.
8. C. Chekuri, S. Khanna, B. Shepherd, "Multicommodity flow, well-linked terminals, and routing problems," Proc. 37th ACM Symp. on Theory of Computing, 2005.
9. J. Chuzhoy, S. Khanna. "Improved hardness results and integrality gaps for edge-disjoint paths," manuscript, 2005, cited in [8].
10. R. Diestel, K.Yu. Gorbunov, T.R. Jensen and C. Thomassen. Highly connected sets and the excluded grid theorem, J. Combin. Theory Ser. B 75 (1999).
11. A. Frank, "Edge-disjoint paths in planar graphs," J. Comb. Theory Ser. B, 39(1985), pp. 164-178.
12. A. Frank, "Packing paths, cuts, and circuits - a survey," in Paths, Flows, and VLSI-Layout, B. Korte, L. Lovász, H.J. Prömel, A. Schrijver, Eds., Berlin: Springer-Verlag, 1990, pp. 49-100.
13. N. Garg, V. Vazirani, M. Yannakakis, "Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover," Proc. International Colloq. on Automata, Languages, and Programming, 1993, pp. 64-75.
14. V. Guruswami, S. Khanna, R. Rajaraman, F.B. Shepherd, M. Yannakakis. Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems. J. Computer and System Sci., 67(3):473-496, 2003.
15. R.M. Karp, "Reducibility among combinatorial problems," Complexity of Computer Computations, R.E. Miller, J.W. Thatcher, Eds., Plenum Press, 1972.
16. R.M. Karp, F.T. Leighton, R. Rivest, C. Thompson, U. Vazirani, V. Vazirani, "Global wire routing in two-dimensional arrays," Algorithmica, 2(1987).
17. J. Kleinberg, "Decision Algorithms for Unsplittable Flow and the Half-Disjoint Paths Problem," Proc. 30th ACM Symposium on Theory of Computing, 1998.
18. J. Kleinberg, R. Rubinfeld, "Short paths in expander graphs," Proc. 37th IEEE Symp. on Foundations of Computer Science, 1996.
19. J. Kleinberg, É. Tardos, "Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks," Proc. 27th ACM Symp. on Theory of Computing, 1995, pp. 26-35.
20. J. Kleinberg, E. Tardos, "Disjoint Paths in Densely Embedded Graphs," Proc. 36th IEEE Symp. on Foundations of Computer Science, 1995, pp. 52-61.
21. P. Kolman, C. Scheideler. Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. Proc. 13th ACM Symp. Parallel Alg. and Arch., 2001.
22. F.T. Leighton, S. Rao, "Circuit switching: a multicommodity flow based approach," Proc. 9th International Parallel Processing Symposium, 1995.
23. T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. Wiley, 1990.
24. N. Linial, A. Magen, and M. Saks. Low distortion Euclidean embedding of trees. Israel J. Math, 106(1998).
25. J. Matousek. On embedding trees into uniformly convex Banach spaces. Israel Journal of Mathematics, 114:221-237, 1999.
26. H. Okamura, "Multicommodity flows in graphs," Discrete Applied Mathematics 6(1983), pp. 55-62.
27. H. Okamura, P. Seymour, "Multicommodity flows in planar graphs," J. Comb. Theory Ser. B, 31(1981).
28. S. Plotkin, "Competitive Routing in ATM networks," IEEE J. Selected Areas in Communications, 1995.
29. W.R. Pulleyblank, "Two Steiner tree packing problems," invited talk at 27th ACM Symposium on Theory of Computing, 1995.
30. P. Raghavan, "Probabilistic construction of deterministic algorithms: approximating packing integer programs," J. Computer and System Sciences, 37(1988).
31. P. Raghavan, C.D. Thompson, "Randomized rounding: a technique for provably good algorithms and algorithmic proofs," Combinatorica, 7(1987).
32. Neil Robertson and P.D. Seymour; Graph minors. III. Planar tree-width. J. Combin. Theory Ser. B 36(1984)
33. Neil Robertson and P.D. Seymour; Graph minors. V. Excluding a planar graph. J. Combin. Theory Ser. B 41(1986)
34. N. Robertson, P.D. Seymour, "An outline of a disjoint paths algorithm," in Paths, Flows, and VLSI-Layout, B. Korte, L. Lovász, H.J. Prömel, A. Schrijver, Eds., Berlin: Springer-Verlag, 1990, pp. 267-292.
35. Neil Robertson, Paul Seymour, and Robin Thomas; Quickly excluding a planar graph. J. Combin. Theory Ser. B 62 (1994) 323-348