Bidimensionality and EPTAS

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 748-759

  Fomin, Fedor V ^a   Lokshtanov, Daniel ^b   Raman, Venkatesh ^c   Saurabh, Saket ^c  

^a UNIVERSITY OF BERGEN   (Norway)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; POLYNOMIAL APPROXIMATION;

ALGORITHMIC TECHNIQUES; BIDIMENSIONALITY THEORY; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; GRAPH OPTIMIZATION PROBLEMS; OBJECTIVE FUNCTION VALUES; PARAMETERIZED ALGORITHM; POLYNOMIAL TIME APPROXIMATION SCHEMES; POLYNOMIAL-TIME ALGORITHMS;

TREES (MATHEMATICS);

EID: 79955709934     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973082.59     Document Type: Conference Paper

References (35)

1. J. ALBER, H. L. BODLAENDER, H. FERNAU, T. KLOKS, AND R. NIEDERMEIER, Fixed parameter al-gorithms for dominating set and related problems on planar graphs, Algorithmica, 33 (2002), pp. 461-493.
2. J. ALBER, M. R. FELLOWS, AND R. NIEDERMEIER, Polynomial-time data reduction for dominating set, Journal of the ACM, 51 (2004), pp. 363-384.
3. S. ARNBORG, J. LAGERGREN, AND D. SEESE, Easy problems for tree-decomposable graphs, J. Algorithms, 12 (1991), pp. 308-340.
4. B. S. BAKER, Approximation algorithms for NP- complete problems on planar graphs, J. ACM, 41 (1994), pp. 153-180.
5. H. BODLAENDER, F. V. FOMIN, D. LOKSHTANOV, E. PENNINKX, S. SAURABH, AND D. M. THILIKOS, (Meta) Kernelization, in FOCS 2009, IEEE, 2009, pp. 629-638.
6. H. L. BODLAENDER, A partial k-arboretum of graphs with bounded treewidth, Theor. Comp. Sc., 209 (1998), pp. 1-45. (Pubitemid 128450429)
7. R. B. BORIE, R. G. PARKER, AND C. A. TOVEY, Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families, Algorithmica, 7 (1992), pp. 555-581.
8. J. CHEN, H. FERNAU, I. A. KANJ, AND G. XIA, Parametric duality and kernelization: Lower bounds and upper bounds on kernel size, SI AM J. Comput., 37 (2007), pp. 1077-1106.
9. B. COURCELLE, The monadic second-order logic of graphs I: Recognizable sets of finite graphs, Information and Computation, 85 (1990), pp. 12-75. (Pubitemid 20680563)
10. B. COURCELLE, The expression of graph properties and graph transformations in monadic second-order logic, Handbook of Graph Grammars, (1997), pp. 313-400.
11. A. DAWAR, M. GROHE, S. KREUTZER, AND N. SCHWEIKARDT, Approximation schemes for first- order definable optimisation problems, LICS 2006, (2006), pp. 411-420. (Pubitemid 47130387)
12. 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. (Pubitemid 41156896)
13. E. D. DEMAINE, F. V. FOMIN, M. HAJIAGHAYI. AND D. M. THILIKOS, Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs, J. ACM, 52 (2005), pp. 866-893. (Pubitemid 43906506)
14. E. D. DEMAINE AND M. HAJIAGHAYI, Bidimensionality: New connections between FPT algorithms and PTASs, in SODA 2005, ACM-SIAM, 2005, pp. 590- 601. (Pubitemid 40851417)
15. E. D. DEMAINE AND M. HAJIAGHAYI, Bidimensionality, in Encyclopedia of Algorithms, M.-Y. Kao, ed., Springer, 2008.
16. E. D. DEMAINE AND M. HAJIAGHAYI, The bidimensionality theory and its algorithmic applications, Comput. J., 51 (2008), pp. 292-302. (Pubitemid 351649934)
17. E. D. DEMAINE AND M. HAJIAGHAYI, Linearity of grid minors in treewidth with applications through bidimensionality, Combinatorica, 28 (2008), pp. 19-36.
18. F. DORN, F. V, FOMIN, AND D. M. THILIKOS, Subexponential parameterized algorithms, Computer Science Review, 2 (2008), pp. 29-39.
19. D. EPPSTEIN, Subgraph isomorphism in planar graphs and related problems, J. Graph Algorithms and Applications, 3 (1999), pp. 1-27.
20. D. EPPSTEIN, Diameter and treewidth in minor-closed graph families, Algorithmica, 27 (2000), pp. 275-291.
21. U. FEIGE, M. HAJIAGHAYI. AND J. R. LEE, Improved approximation algorithms for minimum-weight vertex separators, in Proceedings of the 37th annual ACM Symposium on Theory of computing (STOC 2005), New York, 2005, ACM Press, pp. 563-572. (Pubitemid 43098629)
22. F. V. FOMIN, P. A. GOLOVACH, AND D. M. THILIKOS, Contraction bidimensionality: the accurate picture, in ESA 2009, vol. 5757 of LNCS, Sptinger, 2009, pp. 706- 717.
23. F. V. FOMIN, D. LOKSHTANOV, V. RAMAN, AND S. SAURABH, Subexponential algorithms for partial cover problems, in FSTTCS, 2009, pp. 193-201.
24. F. V. FOMIN, D. LOKSHTANOV, S. SAURABH, AND D. M. THILIKOS, Bidimensionality and kernels, in SODA 2010, ACM-SIAM, 2010, pp. 503-510.
25. F. V. FOMIN AND D. M. THILIKOS, New upper bounds on the decompusability of planar graphs, Journal of Graph Theory, 51 (2006), pp. 53-81.
26. F. V. FOMIN AND D. M. THILIKOS, New upper bounds on the decomposability of planar graphs, J. Graph Theory, 51 (2006), pp. 53-81.
27. R. GANDHI, S. KHULLER, AND A. SRINIVASAN, Approximation algorithms for partial covering problems, J. Algorithms, 53 (2004), pp. 55 - 84.
28. M. GROHE, Local tree-width, excluded minors, and approximation algorithms, Combinatorica, 23 (2003), pp. 613-632. (Pubitemid 38483536)
29. S. KHANNA AND R. MOTWANI, Towards a syntactic characterization of ptas, in STOC 1996, ACM, 1996, pp. 329-337.
30. J. KLEINBERCG AND A. KUMAR, Wavelength conversion in optical networks, Journal of Algorithms, 38 (2001), pp. 25-50. (Pubitemid 33667199)
31. D. J. KLEITMAN AND D. B. WEST, Spanning trees with many leaves, SIAM J. Discrete Math., 4 (1991), pp. 99-106.
32. R. J. LIPTON AND R. E. TARJAN, A separator theorem for planar graphs, SIAM J. Appl. Math., 36 (1979), pp. 177-189.
33. R. J. LIPTON AND R. E. TARJAN, Applications of a planar separator theorem, SIAM J. Coinput., 9 (1980), pp. 615-627.
34. N. ROBERTSON, P. D. SEYMOUR, AND R. THOMAS, Quickly excluding a planar graph, J. Comb. Theory Series B, 62 (1994), pp. 323-348.
35. S. TAZARI AND M. MULLER-HANNEMANN, Dealing with large hidden constants: Engineering a planar steiner tree ptas, in ALENEX, SIAM, 2009, pp. 120- 131.