A nearly linear time algorithm for the half integral disjoint paths packing

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 446-454

  Kawarabayashi, Ken Ichi ^a   Reed, Bruce ^b,c  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^b MCGILL UNIVERSITY   (Canada)

^c UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; PORT TERMINALS;

OPTIMIZ ATION PROBLEMS; TIME ALGORITHMS; UNSPLITTABLE FLOW;

ALGORITHMS;

EID: 58449096775     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (43)

1. S. Arnborg and A. Proskurowski, Linear time algorithms for NP-hard problems restricted to partial ktrees, Discrete Appl. Math. 23 (1989), 11-24.
2. E. Birmelé, J.A. Bondy and B. A. Reed, Tree-width of graphs with no 3 × 3 grid minor, preprint.
3. H. L. Bodlaender, A linear-time algorithm for finding tree-decomposition of small treewidth, SIAM J. Cornput. 25 (1996), 1305-1317.
4. C. Chekuri, S. Khanna and B. Shepherd, Edge-disjoint paths in planar graphs, Proc. 45th Ann. IEEE Symp. Found. Comp. Sci., 2004, pp. 71-80.
5. C. Chekuri, S. Khanna and B. Shepherd, Edge-Disjoint Paths in Planar Graphs with Constant Congestion. 38th ACM Symposium on Theory of Computing (STOC), 2006.
6. C. Chekuri, S. Khanna and B. Shepherd, Multicommodity flow, well-linked terminals, and routing problems. 37th ACM Symposium on Theory of Computing (STOC), 2005.
7. C. Chekuri, S. Khanna and B. Shepherd, The All-or-Nothing Multicommodity Flow Problem. 36th ACM Symposium on Theory of Computing (STOC), 2004.
8. E. D. Demaine and M. Hajiaghayi, Graphs excluding a fixed minor have grids as large as tree-width, with combinatorial and algorithmic applications through bidimentionality, in Proceeding of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA, 2005), 2005, 682-689.
9. E. D. Demaine, F. Fomin, M. Hajiaghayi, and D. Thilikos, Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs, J. ACM 52 (2005), 1-29.
10. E. D. Demaine and M. Hajiaghayi, Fast algorithms for hard graph problems: Bidimensionality, minors and local tree-width, Proc. 12th Internat. Symp. on Graph Drawing, Lecture Notes in Computer Science 3383, Springer, 2004, pp. 517-533.
11. E. D. Demaine, M. Hajiaghayi, and K. Kawarabayashi, Algorithmic graph minor theory: Decomposition, approximation and coloring, Proc. 46th Ann. IEEE Symp. Found. Comp. Sci., Pittsburgh, PA, 2005, pp. 637-646.
12. 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), 61-73.
13. A. Frank, Packing paths, cuts and circuits - a survey, in Paths, Flows and VLSI-Layout B. Korte, L. Lovász, H.J. Promel and A. Schrijver. Eds. Berlin: Springer-Verlag 1990, 49-100.
14. H. Gabow, Finding paths and cycles of superpolylogarithmic length, STOC'04, 407-416, Chicago, Illinois, USA.
15. N. Garg, V. Varzirani and M. Yannakakis, Primal-dual approximation algorithms for integral flow and multicut in trees with applications to matching and set cover, Proc. ICALP 1993, 64-75.
16. T. Ibaraki and H. Nagamichi, A linear time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph, Algorithmica 7, (1992), 583-596.
17. D. Johnson, The Many Faces of Polynomial Time, J. Algorithms, 8, (1987), 285-303.
18. R. M. Karp, On the computational complexity of combinatorial problems, Networks 5 (1975), 45-48.
19. K. Kawarabayashi and B. Mohar, Approximating chromatic number and list-chromatic number of minorclosed and odd minor-closed classes of graphs, Proc. 38th ACM Symposium on Theory of Computing (STOC'06), (2006), 401-416.
20. K. Kawarabayashi, Z. Li and B. Reed, Fast recognition and optimization algorithms for minor-closed graph families, preprint.
21. J. Kleinberg. Decision algorithms for unsplittable flow and the half-disjoint paths problem. Proc. 30th ACM Symposium on Theory of Computing, 1998.
22. J. Kleinberg. Single-source unsplittable flow. Proc. 37th IEEE Symposium on Foundations of Computer Science, 1996.
23. J. Kleinberg, E. Tardos. Disjoint paths in densely embedded graphs. Proc. 36th IEEE Symposium on Foundations of Computer Science, 1995.
24. J. Kleinberg, E. Tardos. Approximations for the disjoint paths problem in high-diameter planar networks. Proc. 27th ACM Symposium on Theory of Computing, 1995.
25. S. Kolliopoulos and C. Stein, Improved approximation algorithm for unspilittable flow problems, FOCS 1997.
26. J.F. Lynch, The equivalence of theorem proving and the interconnection problem, ACM SIGDA, Newsletter, 5, (1975), 31-65.
27. M. Middendorf and F. Pfeiffer, On the complexity of the disjoint paths problem, Combinatorica, 13 (1993), 97-107.
28. L. Pérković and B. Reed, An improved algorithm for finding tree decompositions of small width; International Journal on the Foundations of Computing Science., 11, (2000), 81-85.
29. B. Reed, Finding approximate separators and computing tree width quickly; STOC 1992, Victoria B.C., 1992.
30. B. Reed, Tree width and tangles: a new connectivity measure and some applications, in "Surveys in Combinatorics, 1997 (London)", London Math. Soc. Lecture Note Ser. 241, Cambridge Univ. Press, Cambridge, 1997, pp. 87-162.
31. B. Reed, Mangoes and blueberries, Combinatorica 19 (1999), 267-296.
32. B. Reed, Rooted Routing in the Plane, Discrete Applied Mathematics 57, 1995, 213-227.
33. B. Reed, N. Robertson, A. Schrijver and P. D. Seymour, Finding disjoint trees in planar graphs in linear time. Graph structure theory (Seattle, WA, 1991), 295-301, Contemp. Math., 147, Amer. Math. Soc., Providenc, RI, 1993.
34. B. Reed, Rooted Routing via Graph Minors, to appear.
35. N. Robertson and P. D. Seymour, Graph minors. V. Excluding a planar graph, J. Combin. Theory Ser. B 41 (1986), 92-114.
36. N. Robertson and P. D. Seymour, Graph minors. X. Obstructions to tree-decomposition, J. Combin. Theory Ser. B 52 (1991) 153-190.
37. N. Robertson and P. D. Seymour, Graph minors. XIII. The disjoint paths problem, J. Combin. Theory Ser. B 63 (1995), 65-110.
38. N. Robertson and P. D. Seymour, Graph minors. XVI. Excluding a non-planar graph, J. Combin. Theory Ser. B 89 (2003), 43-76.
39. N. Robertson and 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, and A. Schrijver (Eds.), Springer-Verlag, Berlin, 1990, pp. 267-292.
40. N. Robertson, P. D. Seymour and R. Thomas, Quickly excluding a planar graph, J. Combin. Theory Ser. B 62 (1994), 323-348.
41. A. Shrijver, P. Seymour and P. Winkler, The ring loading problem, Siam J. Discrete Math. 1, (1998), 147-152.
42. P. Seymour and R. Thomas, Graph searching and a min-max theorem for tree-width, J. Combin. Theory Ser. B 58 (1993), 22-33.
43. A. Srinviasan, Improvded approximations for edgedisjoint paths, unspittable flow and related routing problems, FOGS 1997.