Catalan structures and dynamic programming in H-minor-free graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 631-640

  Dorn, Frederic ^a   Fomin, Fedor V ^a   Thilikos, Dimitrios M ^b  

^a UNIVERSITY OF BERGEN   (Norway)

^b UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

PROGRAMMING THEORY; SYSTEMS ENGINEERING;

GENERAL FRAMEWORK; GRAPH CLASSES;

ALGORITHMS;

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

References (34)

1. J. ALBER, H. L. BODLAENDER, H. FERNAU, T. KLOKS, AND R. NIEDERMEIER, Fixed parameter algorithms for dominating set and related problems on planar graphs, Algorithmica, 33 (2002), pp. 461-493.
2. J. ALBER, H. FERNAU, AND R. NIEDERMEIER, Parameterized complexity: exponential speed-up for planar graph problems, J. Algorithms, 52 (2004), pp. 26-56.
3. N. ALON, P. SEYMOUR, AND R. THOMAS, A separator theorem for nonplanar graphs, J. Amer. Math. Soc., 3 (1990), pp. 801-808.
4. N. ALON, R. YUSTER, AND U. ZWICK, Color-coding, J. Assoc. Comput. Mach., 42 (1995), pp. 844-856.
5. S. ARORA, M. GRIGNI, D. KARGER, P. KLEIN, AND A. WOLOSZYN, A polynomial-time approximation scheme for weighted planar graph TSP, in Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), New York, 1998, ACM, pp. 33-41.
6. W. COOK AND P. SEYMOUR, Tour merging via branchdecomposition, INFORMS Journal on Computing, 15 (2003), pp. 233-248.
7. A. DAWAR, M. GROIIE, AND S. KREUTZER, Locally excluding a minor, preprint NI07001-LAA, Isaac Newton Institute of Mathematical Sciences, (2007).
8. V. G. DEǏNEKO, B. KLINZ, AND G. J. WOEGINGER, Exact algorithms for the Hamiltoman cycle problem in planar graphs, Oper. Res. Lett., 34 (2006), pp. 269-274.
9. E. D. DEMAINE, F. V. FOMIN, M. HAJIAGHAYI, AND D. M. THILIKOS, Bidimensional parameters and local treewidth, SIAM J. Discrete Math., 18 (2004/05), pp. 501-511 (electronic).
10. -, Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs, Journal of the ACM, 52 (2005), pp. 866-893.
11. E. D. DEMAINE AND M. HAJIAGHAYI, The bidimensionality theory and its algorithmic applications, Computer Journal, to appear.
12. -, Linearity of grid minors in treewidth with applications through bidimensionality, Combinatorica, to appear.
13. -, Bidimensionality: new connections between FPT algorithms and PTASs, in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), New York, 2005, ACM-SIAM, pp. 590-601.
14. E. D. DEMAINE, M. HAJIAGHAYI, AND B. MOHAR, Approximation algorithms via contraction decomposition, in Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), 2007, pp. 278-287.
15. E. D. DEMAINE, M. T. HAJIAGHAYI, AND K. KAWARABAYASHI, Algorithmic graph minor theory: Decomposition, approximation, and coloring, in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOGS 2005), IEEE Computer Society, 2005, pp. 637-646.
16. E. D. DEMAINE, M. T. HAJIAGHAYI, AND D. M. THILIKOS, Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors., Algorithmica, 41 (2005), pp. 245-267.
17. F. DORN, F. V. FOMIN, AND D. M. THILIKOS, Fast subexponential algorithm for non-local problems on graphs of bounded genus, in Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT 2006), vol. 4059 of LNCS, Springer, Berlin, 2006, pp. 172-183.
18. -, Catalan structures and dynamic programming in h-minor-free graphs, 2007. manuscript, http://www.ii.uib.no/publikasjoner/texrap/pdf/ 2007-357.pdf.
19. F. DORN, E. PENNINKX, H. BODLAENDER, AND F. V. FOMIN, Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions, in Proceedings of the 13th Annual European Symposium on Algorithms (ESA 2005), vol. 3669 of LNCS, Springer, Berlin, 2005, pp. 95-106.
20. R. G. DOWNEY AND M. R. FELLOWS, Parameterized complexity, Springer-Verlag, New York, 1999.
21. J. FLUM AND M. GROHE, Parameterized Complexity Theory, Texts in Theoretical Computer Science. An EATCS Series, Springer-Verlag, Berlin, 2006.
22. F. V. FOMIN AND D. M. THILIKOS, Dominating sets in planar graphs: Branch-width and exponential speed-up, SIAM J. Comput., 36 (2006), pp. 281-309.
23. M. GRIGNI, Approximate TSP in graphs with forbidden minors., in proceedings of the 27th International Colloquiuni Autornata, Languages and Programming (ICALP 2000), vol. 1853 of Lecture Notes in Computer Science, Springer, 2000, pp. 869-877.
24. 3) time, in Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), vol. 3580 of LNCS, Springer, Berlin, 2005, pp. 373-384.
25. R. IMFAGLIAZZO, R. PATURI, AND F. ZANE, Which problems have strongly exponential complexity, Journal of Computer and System Sciences, 63 (2001), pp. 512-530.
26. P. N. KLEIN, A linear-time approximation scheme for planar weighted TSP, in Proceedings of 46th Annual IEEE Symposium on Foundations of Computer Science (FOGS 2005), IEEE Computer Society, 2005, pp. 647-657.
27. B. MOHAR AND C. THOMASSEN, Graphs on surfaces, Johns Hopkins University Press, Baltimore, MD, 2001.
28. R. NIEDERMEIER, Invitation to fixed-parameter algorithms, vol. 31 of Oxford Lecture Series in Mathematics and its Applications, Oxford University Press, Oxford, 2006.
29. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, On limited nondeterminism and the complexity of the v-c dimension, J. Comput. Syst. Sci., 53 (1996), pp. 161-170.
30. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. VII. Disjoint paths on a surface, J. Combin. Theory Ser. B, 45 (1988), pp. 212-254.
31. -, Graph minors. XI. Circuits on a surface, J. Combin. Theory Ser. B, 60 (1994), pp. 72-106.
32. -, Graph minors. XVI. Excluding a non-planar graph, J. Combin. Theory Ser. B, 89 (2003), pp. 43-76.
33. P. D. SEYMOUR AND R. THOMAS, Call routing and the ratcatcher, Combinatorica, 14 (1994), pp. 217-241.
34. C. THOMASSEN, Embeddings of graphs with no short noncontractible cycles, J. Combin. Theory Ser. B, 48 (1990), pp. 155-177.