Faster approximation schemes and parameterized algorithms on H-minor-free and odd-minor-free graphs

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

Volumn 6281 LNCS, Issue , 2010, Pages 641-652

  Tazari, Siamak ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Graph Minors; Odd Minors; Subexponential Algorithms

Indexed keywords

ALGORITHMIC TECHNIQUES; APPROXIMATION SCHEME; DOMINATING SETS; DYNAMIC PROGRAMMING TECHNIQUES; FREE GRAPHS; GENERAL METHODOLOGIES; GRAPH CLASS; GRAPH MINORS; INDEPENDENT SET; LONGEST PATH; MAX-CUT; MINOR-CLOSED GRAPH CLASS; ODD MINORS; PARAMETERIZED ALGORITHM; RUNNING TIME; STEINER TREES; STRUCTURAL DECOMPOSITION; SUB-EXPONENTIAL ALGORITHMS; SUBGRAPHS; VERTEX COVER;

COMPUTER SCIENCE; DOMAIN DECOMPOSITION METHODS; DYNAMIC PROGRAMMING; GRAPHIC METHODS; PARAMETERIZATION; THEOREM PROVING; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS;

EID: 78349253411     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15155-2_56     Document Type: Conference Paper

References (25)

1. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153-180 (1994)
2. Eppstein, D.: Diameter and treewidth in minor-closed graph families. Algorithmica 27(3), 275-291 (2000)
3. Grohe, M.: Local tree-width, excluded minors, and approximation algorithms. Combinatorica 23(4), 613-632 (2003)
4. Klein, P.N.: A linear-time approximation scheme for TSP in undirected planar graphs with edge-weights. SIAM J. Comput. 37(6), 1926-1952 (2008)
5. Demaine, E.D., Hajiaghayi, M., Kawarabayashi, K.: Algorithmic graph minor theory: Decomposition, approximation, and coloring. In: FOCS 2005: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 637-646. IEEE Computer Society, Los Alamitos (2005)
6. Robertson, N., Seymour, P.: Graph minors. XVI. Excluding a non-planar graph. J. Comb. Theory Ser. B 89(1), 43-76 (2003)
7. Dawar, A., Grohe, M., Kreutzer, S.: Locally excluding a minor. In: LICS 2007: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science, pp. 270-279. IEEE Computer Society, Los Alamitos (2007)
8. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
9. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
10. Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. J. ACM 52(6), 866-893 (2005)
11. Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. SIGACT News 38(1), 31-45 (2007)
12. Dorn, F., Fomin, F.V., Lokshtanov, D., Raman, V., Saurabh, S.: Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. In: STACS 2010: Proceedings of the 27th Symposium on Theoretical Aspects of Computer Science, pp. 251-262 (2010)
13. Guenin, B.: A characterization of weakly bipartite graphs. J. Comb. Theory Ser. B 83(1), 112-168 (2001)
14. Geelan, J., Gerards, B., Goddyn, L., Reed, B., Seymour, P., Vetta, A.: The odd case of Hadwiger's conjecture (Submitted, 2004)
15. Kawarabayashi, K., Mohar, B.: Approximating chromatic number and list-chromatic number of minor-closed and odd-minor-closed classes of graphs. In: STOC 2006: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 401-406. ACM Press, New York (2008)
16. Demaine, E.D., Hajiaghayi, M., Kawarabayashi, K.: Decomposition, approximation, and coloring of odd-minor-free graphs. In: SODA 2010: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 329-344. SIAM, Philadelphia (2010)
17. 4-subdivision, parity 2-disjoint rooted paths and parity cycle through specified elements. In: SODA 2010: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 318-328. SIAM, Philadelphia (2010)
18. Mader, W.: Homomorphieeigenschaften und mittlere Kantendichte von Graphen. Math. Ann. 174, 265-268 (1967)
19. Grohe, M.: Logic, graphs, and algorithms. In: Logic and Automata - History and Perspectives. Amsterdam University Press, Amsterdam (2007)
20. Robertson, N., Seymour, P.D.: Graph minors. XX. Wagner's conjecture. J. Comb. Theory Ser. B 92(2), 325-357 (2004)
21. Demaine, E.D., Hajiaghayi, M.: Bidimensionality: new connections between FPT algorithms and PTASs. In: SODA 2005: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 590-601 (2005)
22. Feige, U., Hajiaghayi, M., Lee, J.R.: Improved approximation algorithms for minimum weight vertex separators. SIAM J. Comput. 38(2), 629-657 (2008)
23. Dorn, F., Fomin, F.V., Thilikos, D.M.: Catalan structures and dynamic programming in H-minor-free graphs. In: SODA 2008: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 631-640. SIAM, Philadelphia (2008)
24. Niedermeier, R.: Invitation to fixed-parameter algorithms. Habilitation thesis, Universität Tübingen, Germany (2002)
25. Demaine, E.D., Hajiaghayi, M.: Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality. In: SODA 2005: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 682-689. SIAM, Philadelphia (2005)