Improved algorithm for the half-disjoint paths problem

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

Volumn 6302 LNCS, Issue , 2010, Pages 287-297

  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: 78149291782     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15369-3_22     Document Type: Conference Paper

References (22)

1. Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math. 23, 11-24 (1989)
2. Bodlaender, H.L.: A linear-time algorithm for finding tree-decomposition of small treewidth. SIAM J. Comput. 25, 1305-1317 (1996)
3. Chekuri, C., Khanna, S., Shepherd, B.: The all-or-nothing multicommodity flow problem. In: Proc. 36th ACM Symposium on Theory of Computing (STOC), pp. 156-165 (2004)
4. 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)
5. Diestel, R., Gorbunov, K.Y., Jensen, T.R., Thomassen, C.: Highly connected sets and the excluded grid theorem. J. Combin. Theory Ser. B 75, 61-73 (1999)
6. 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)
7. Garg, N., Varzirani, V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees with applications to matching and set cover. In: Lingas, A., Carlsson, S., Karlsson, R. (eds.) ICALP 1993. LNCS, vol. 700, pp. 64-75. Springer, Heidelberg (1993)
8. Johnson, D.: The many faces of polynomial time. J. Algorithms 8, 285-303 (1987)
9. Karp, R.M.: On the computational complexity of combinatorial problems. Networks 5, 45-68 (1975)
10. Kawarabayashi, K., Reed, B.: A nearly linear time algorithm for the half disjoint paths packing. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 446-454 (2008)
11. Kleinberg, J.: Single-source unsplittable flow. In: Proc. 37th Ann. IEEE Symp. Found. Comp. Sci. (FOCS), pp. 68-77 (1996)
12. Kleinberg, J.: Decision algorithms for unsplittable flows and the half-disjoint paths problem. In: Proc. 30th ACM Symposium on Theory of Computing (STOC), pp. 530-539 (1998)
13. Kolliopoulos, S., Stein, C.: Improved approximation algorithm for unsplittable flow problems. In: Proc. 38th Ann. IEEE Symp. Found. Comp. Sci. (FOCS), pp. 426-435 (1997)
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. Kreutzer, S., Tazari, S.: On brambles, grid-like minors and parameterized intractability of monadic second-order logic. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 354-362 (2010)
16. Middendorf, M., Pfeiffer, F.: On the complexity of the disjoint paths problem. Combinatorica 13, 97-107 (1993)
17. 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)
18. Reed, B., Wood, D.: Polynomial treewidth forces a large grid-like minor, available at arXiv:0809.0724v3[math.CO] (2008)
19. Robertson, N., Seymour, P.D.: Graph minors. V. Excluding a planar graph. J. Combin. Theory Ser. B 41, 92-114 (1986)
20. Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B 63, 65-110 (1995)
21. Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a planar graph. J. Combin. Theory Ser. B 62, 323-348 (1994)
22. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Algorithm and Combinatorics, vol. 24. Springer, Heidelberg (2003)