Known algorithms on graphs of bounded treewidth are probably optimal

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 777-789

  Lokshtanov, Daniel ^a   Marx, Dániel ^b   Saurabh, Saket ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b HUMBOLDT UNIVERSITY   (Germany)

^c INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

BEST-KNOWN ALGORITHMS; BOUNDED TREEWIDTH; DOMINATING SETS; INDEPENDENT SET; LOWER BOUNDS; ODD CYCLE TRANSVERSALS; RUNNING TIME; STRONG EXPONENTIAL TIME HYPOTHESIS;

ALGORITHMS;

EID: 79955722390     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973082.61     Document Type: Conference Paper

References (29)

1. J. ALBER AND R. NIEDERMEIER, Improved tree decomposition based algorithms for domination-like problems, in LATIN, 2002, pp. 613-628.
2. A. BJÖRklund, T. HUSFELDT, P. KASKI, AND M. KOIVISTO, Fourier meets möbius: fast subset convolution, in STOC, 2007, pp. 67-74. (Pubitemid 47630722)
3. C. CALABRO, R. IMPAGLIAZZO, AND R. PATURI, The complexity of satisfiability of small depth circuits, in IWPEC, 2009, pp. 75-85.
4. J. CHEN, X. HUANG, I. A. KANJ, AND G. XIA, On the computational hardness based on linear FPT- reductions, J. Comb. Optim., 11 (2006), pp. 231-247.
5. J. CHEN, X. HUANG, I. A. KANJ, AND G. XIA -, Strong computational lower bounds via param-eterized complexity, J. Comput. Syst. Sci., 72 (2006), pp. 1346-1367. (Pubitemid 44647246)
6. E. D, DEMAINE. F. V. FOMIN, M. T. HAJIAGHAYI. AND D. M. THILIKOS, Subexponential parameterized algorithms on bounded-genus graphs and -minor-free graphs. J. ACM, 52 (2005), pp. 866-893. (Pubitemid 43906506)
7. E. D. DEMAINE AND M. HAJIAGHAYI, The bidimen- sionality theory and its algorithmic applications, Com- put. J., 51 (2008), pp. 292-302. (Pubitemid 351649934)
8. D. EPPSTEIN, Diameter and treewidth m minor-closed graph families, Algorithmica, 27 (2000), pp. 275-291.
9. S. FIORINI, N. HARDY, B. A. REED, AND A. VETTA, Planar graph bipartization in linear time, Discrete Applied Mathematics, 156 (2008),.
10. J. FLUM AND M. GROHE, Parameterized Complexity Theory, Springer, Berlin, 2006.
11. F. FOMIN, P. GOLOVACH, D. LOKSHTANOV, AND S. SAURABH, Algorithmic lower bounds for problems parameterized by clique-width, in SODA, 2010, pp. 493- 502.
12. F. V. FOMIN. S. GASPERS, S. SAURABH, AND A. A. STEPANOV, On two techniques of combining branching and treewidth, Algorithmica, 54 (2009), pp. 181-207.
13. R. IMPAGLIAZZO AND R. PATURI, On the complexity of k-sat, J. Comput. Syst. Sci., 62 (2001), pp. 367-375. (Pubitemid 32334556)
14. R. IMPAGLIAZZO, R. PATURI, AND F. ZANE, Which problems have strongly exponential complexity?, J. Comput. Syst. Sci., 63 (2001), pp. 512-530. (Pubitemid 34325767)
15. J. KLEINBERG AND E. TARDOS, Algorithm Design, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2005.
16. D. LOKSHTANOV, D. MARX, AND S. SAURABH, Known algorithms on graphs of bounded treewidth are probably optimal, CoRR, abs/1007.5450 (2010).
17. D. LOKSHTANOV, S. SAURABH, AND S. SIKDAR, Simpler parameterized algorithm for oct, in IWOCA, 2009, pp. 380-384.
18. D. MARX, Can you beat treewidth?, in FOCS, 2007, pp. 169-179.
19. D. MARX, On the optimality of planar and geometric approximation schemes, in FOCS, 2007, pp. 338-348.
20. D. MÖLLE, S. RLCHTER, AND P. ROSSMANITH, Enumerate and expand: Improved algorithms for connected vertex cover and tree cover, Theory Comput. Syst., 43 (2008), pp. 234-253.
21. R. NLEDERMEIER, Invitation to fixed-parameter algorithms, vol. 31 of Oxford Lecture Series in Mathematics and its Applications, Oxford University Press, Oxford, 2006.
22. M. PATRACU AND R. WILLIAMS, On the possibility of faster sat algorithms, in Proc. 21st ACM/SIAM Symposium on Discrete Algorithms (SODA), 2010. To appear.
23. B. REED, K. SMITH, AND A. VETTA, Finding odd cycle transversals, Operations Research Letters, 32 (2004), pp. 299-301.
24. A. D. SCOTT AND G. B. SORKIN, Linear-programming design and analysis of fast algorithms for max 2-csp, Discrete Optimization, 4 (2007), pp. 260-287. (Pubitemid 350167029)
25. A. TAKAHASHI, S. UENO, AND Y. KAJITANI, Mixed searching and proper-path-width, Theor. Comput. Sci., 137 (1995), pp. 253-268.
26. J. A, TELLE AND A, PROSKUROWSKI, Practical algorithms on partial k-trees with an application to domination-like problems, in WADS, 1993, pp. 610- 621,.
27. D. M. THILIKOS, M, J, SERNA, AND H. L. BODLAEN- DER, Cutwidth i: A linear time fixed parameter algorithm, J. Algorithms, 56 (2005), pp. 1-24. (Pubitemid 40786384)
28. J, M, M. VAN ROOU, H. L. BODLAENDER, AND P. ROSSMANITH, Dynamic programming on tree decompositions using generalised fast subset convolution, in ESA, 2009, pp. 566-577.
29. J. M. M. VAN ROOIJ, J. NEDERLOF, AND T, C. VAN DIJK, Inclusion/exclusion meets measure and conquer, in ESA, 2009, pp. 554-565.