An O(log n)-approximation algorithm for the disjoint paths problem in Eulerian planar graphs and 4-edge-connected planar graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6302 LNCS, Issue , 2010, Pages 274-286

  Kawarabayashi, Ken Ichi ^a,b   Kobayashi, Yusuke ^a,b  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78149306564     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15369-3_21     Document Type: Conference Paper

References (21)

1. Andrews, M., Chuzhoy, J., Khanna, S., Zhang, L.: Hardness of the undirected edge-disjoint paths problem with congestion. In: Proc. 46th IEEE Symposium on Foundations of Computer Science (FOCS), 226-244 (2005)
2. Chekuri, C., Khanna, S., Shepherd, B.: Edge-disjoint paths in planar graphs. In: Proc. 45th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 71-80 (2004)
3. Chekuri, C., Khanna, S., Shepherd, B.: Multicommodity flow, well-linked terminals, and routing problems. In: Proc. 37th ACM Symposium on Theory of Computing (STOC), pp. 183-192 (2005)
4. Chekuri, C., Khanna, S., Shepherd, B.: Edge-disjoint paths in planar graphs with constant congestion. In: Proc. 38th ACM Symposium on Theory of Computing (STOC), pp. 757-766 (2006)
5. Frank, A.: Packing paths, cuts and circuits - a survey. In: Korte, B., Lovász, L., Promel, H.J., Schrijver, A. (eds.) Paths, Flows and VLSI-Layout, pp. 49-100. Springer, Berlin (1990)
6. Guruswami, V., Khanne, S., Rajaraman, R., Shephard, B., Yannakakis, M.: Near-optimal hardness results and apprixmaiton algorithms for edge-disjoint paths and related problems. J. Comp. Styst. Science 67, 473-496 (2003);
7. Also Proc. 31st ACM Symposium on Theory of Computing (STOC 1999), pp. 19-28 (1999)
8. Karp, R.M.: On the computational complexity of combinatorial problems. Networks 5, 45-68 (1975)
9. Kawarabayashi, K., Kobayashi, Y.: The edge-disjoint paths problem for 4-edge-connected graphs and Eulerian graphs. To appear in ACM-SIAM Symposium on Discrete Algorithms, SODA (2010)
10. Kawarabayashi, K., Kobayashi, Y., Reed, B.: The disjoint paths problem in quadratic time, manuscript
11. Kleinberg, J.: An approximation algorithm for the disjoint paths problem in even-degree planar graphs. In: Proc. 46th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 627-636 (2005)
12. Kleinberg, J., Tardos, E.: Disjoint paths in densely embedded graphs. In: Proc. 36th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 52-61 (1995)
13. Kleinberg, J., Tardos, E.: Approximations for the disjoint paths problem in high-diameter planar networks. In: Proc. 27th ACM Symposium on Theory of Computing (STOC), pp. 26-35 (1995)
14. Kramer, M.R., van Leeuwen, J.: The complexity of wirerouting and finding minimum area layouts for arbitrary VLSI circuits. Adv. Comput. Res. 2, 129-146 (1984)
15. Middendorf, M., Pfeiffer, F.: On the complexity of the disjoint paths problem. Combinatorica 13, 97-107 (1993)
16. Nishizeki, T., Vygen, J., Zhou, X.: The edge-disjoint paths problem is NP-complete for series-parallel graphs. Discrete Applied Math. 115, 177-186 (2001) (Pubitemid 33676182)
17. Okamura, H., Seymour, P.D.: Multicommodity flows in planar graphs. J. Combin. Theory Ser. B 31, 75-81 (1981)
18. Reed, B.: Tree width and tangles: a new connectivity measure and some applications. In: Surveys in Combinatorics. London Math. Soc. Lecture Note Ser., vol. 241, pp. 87-162. Cambridge Univ. Press, Cambridge (1997)
19. Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B 63, 65-110 (1995)
20. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, Algorithm and Combinatorics, vol. 24. Springer, Heidelberg (2003)
21. Seymour, P.D.: On odd cuts and plane multicommodity flows. Proceedings of the London Mathematical Society 42, 178-192 (1981)