Equivalence of Local Treewidth and Linear Local Treewidth and its Algorithmic Applications

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 833-842

  Demaine, Erik D ^a   Hajiaghayi, MohammadTaghi ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

GRAPH MINOR THEORY; LINEAR BOUNDS; TREEWIDTH;

TREES (MATHEMATICS);

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

References (33)

1. J. ALBER, H. L. BODLAENDER, H. FERNAU, AND R. NIEDERMEIER, Fixed parameter algorithms for planar dominating set and related problems, in Algorithm theory - Scandinavian Workshop on Algorithm Theory 2000 (Bergen, 2000), Springer, Berlin, 2000, pp. 97-110.
2. N. ALON, P. SEYMOUR, AND R. THOMAS, A separator theorem for graphs with excluded minor and its applications, in Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (Baltimore, 1990), 1990, pp. 293-299.
3. S. ARNBORG AND A. PROSKUROWSKI, Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Appl. Math., 23 (1989), pp. 11-24.
4. B. S. BAKER, Approximation algorithms for NP-complete problems on planar graphs, J. Assoc. Comput. Mach., 41 (1994), pp. 153-180.
5. 1 norm, in The 43th Annual Symposium on Foundations of Computer Science (FOCS'02), 2002, pp. 551-560.
6. 1, in ACM-SIAM Symposium on Discrete Algorithms (SODA'03), 2003, pp. 527 - 536.
7. 5-free graphs, J. Algorithms, 26 (1998), pp. 166-187.
8. N. CHIBA, T. NISHIZEKI, AND N. SAITO, An approximation algorithm for the maximum independent set problem on planar graphs, SIAM J. Comput., 11 (1982), pp. 663-675.
9. E. D. DEMAINE, F. V. FOMIN, M. HAJIAGHAYI, AND D. M. THILIKOS, Fixed-parameter algorithms for the (k,r)-center in planar graphs and map graphs, in The 30th International Colloquium on Automata, Languages and Programming (ICALP 2003), 2003. To appear.
10. E. D. DEMAINE AND M. HAJIAGHAYI, Equivalence of local treewidth and linear local treewidth and its algorithmic applications, Tech. Rep. MIT-LCS-TR-903, M.I.T, May 2003.
11. E. D. DEMAINE, M. HAJIAGHAYI, N. NISHIMURA, P. RAGDE, AND D. M. THILIKOS, Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. To appear in Journal of Computer and System Sciences.
12. E. D. DEMAINE, M. HAJIAGHAYI, AND D. M. THILIKOS, A 1.5-approximation for treewidth of graphs excluding a graph with one crossing, in The 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (Italy, APPROX 2002), LNCS, 2002, pp. 67-80.
13. 5-minor-free graphs, in The 13th Annual International Symposium on Algorithms and Computation (Vancouver, ISAAC 2002), 2002, pp. 262-273.
14. D. EPPSTEIN, Subgraph isomorphism in planar graphs and related problems, in Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, 1995), New York, 1995, ACM, pp. 632-640.
15. _, Diameter and treewidth in minor-closed graph families, Algorithmica, 27 (2000), pp. 275-291.
16. M. FRICK AND M. GROHE, Deciding first-order properties of locally tree-decomposable graphs, J. ACM, 48 (2001), pp. 1184-1206.
17. M. GROHE, Local tree-width, excluded minors, and approximation algorithms. To appear in Combinatorica.
18. 1-embeddings of graphs, in The 40th Annual Symposium on Foundations of Computer Science (FOCS'99), 1999, pp. 399-409.
19. 5-minor-free graphs, in Euroconference on Combinatorics, Graph Theory and Applications 2001 (Barcelona, 2001), 2001.
20. P. N. KLEIN, S. A. PLOTKIN, AND S. RAO, Excluded minors, network decomposition, and multicommodity flow, in The Twenty-Fifth Annual ACM Symposium on Theory of Computing (STOC'93), 1993, pp. 682-690.
21. R. J. LIPTON AND R. E. TARJAN, Applications of a planar separator theorem, SIAM J. Comput., 9 (1980), pp. 615-627.
22. S. A. PLOTKIN, S. RAO, AND W. D. SMITH, Shallow excluded minors and improved graph decompositions, in The Fifth Annual ACM-SIAM Symposium on Discrete Algorithms(SODA'94), 1994, pp. 462-470.
23. N. ROBERTSON AND P. SEYMOUR, Excluding a graph with one crossing, in Graph structure theory (Seattle, WA, 1991), Amer. Math. Soc., Providence, RI, 1993, pp. 669-675.
24. N. ROBERTSON, P. SEYMOUR, AND R. THOMAS, Quickly excluding a planar graph, J. Combin. Theory Ser. B, 62 (1994), pp. 323-348.
25. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. II. Algorithmic aspects of tree-width, J. Algorithms, 7 (1986), pp. 309-322.
26. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. VII. Disjoint paths on a surface, J. Combin. Theory Ser. B, 45 (1988), pp. 212-254.
27. _, Graph minors. X. Obstructions to tree-decomposition, J. Combin. Theory Ser. B, 52 (1991), pp. 153-190.
28. _, Graph minors. XI. Circuits on a surface, J. Combin. Theory Ser. B, 60 (1994), pp. 72-106.
29. _, Graph minors. XII. Distance on a surface, J. Combin. Theory Ser. B, 64 (1995), pp. 240-272.
30. _, Graph minors. XII. Distance on a surface, J. Combin. Theory Ser. B, 64 (1995), pp. 240-272.
31. _, Graph minors. XVII. Taming a vortex, J. Combin. Theory Ser. B, 77 (1999), pp. 162-210.
32. N. ROBERTSON AND P. D. SEYMOUR, Graph minors XVI. excluding a non-planar graph, (2003). To appear in J. Combin. Theory Ser. B, available electronically in journal site.
33. M. YANNAKAKIS, Node- and edge-deletion NP-complete problems, in Conference Record of the Tenth Annual ACM Symposium on Theory of Computing (San Diego, CA, 1978), ACM press, New York, 1978, pp. 253-264.