Approximation schemes for first-order definable optimisation problems

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2006, Pages 411-420

  Dawar, Anuj ^a   Grohe, Martin ^b   Kreutzer, Stephan ^b   Schweikardt, Nicole ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING;

GAIFMAN'S LOCALITY THEOREM; MAXIMIZATION PROBLEM; POLYNOMIAL TIME APPROXIMATION;

APPROXIMATION THEORY;

EID: 34547301294     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2006.13     Document Type: Conference Paper

References (24)

1. N. Alon, P. Seymour, and R. Thomas. A separator theorem for graphs with an excluded minor and its applications. In Proc. of STOC'90, pages 293-299, 1990.
2. S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. Journal of Algorithms, 12(2):308-340, 1991.
3. A. Atserias, A. Dawar, and M. Grohe. Preservation under extensions on well-behaved finite structures. In Proc. of ICALP'05, volume 3580 of LNCS, pages 1437-1450. Springer-Verlag, 2005.
4. B. Baker. Approximation algorithms for NP-complete problems on planar graphs. J. ACM, 41:153-180, 1994.
5. L. Cai, M. Fellows, D. Juedes, and F. Rosamond. The complexity of polynomial-time approximation. Theory of Computing Systems. To appear.
6. B. Courcelle. Graph rewriting: An algebraic and logic approach. In J. van Leeuwan, editor, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics, pages 193-242. Elsevier, 1990.
7. E. Demaine, M. Hajiaghayi, and K. Kawarabayashi. Algorithmic graph minor theory: Decomposition, approximation, and coloring. In Proc. of FOCS'05, pages 637-646, 2005.
8. R. Diestel. Graph Theory. Springer-Verlag, 2nd edition, 2000.
9. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 2nd edition, 1999.
10. D. Eppstein. Subgraph isomorphism in planar graphs and related problems. Journal of Graph Algorithms and Applications, 3:1-27, 1999.
11. J. Flum and M. Grohe. Parameterized Complexity Theory. Springer Verlag, 2006.
12. H. Gaifman. On local and non-local properties. In J. Stern, editor, Proceedings of the Herbrand Symposium, Logic Colloquium '81, pages 105-135. North Holland, 1982.
13. M. R. Garey, D. S. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1:237-267, 1976.
14. M. Grohe. Local tree-width, excluded minors, and approximation algorithms. Combinatorica, 23(4):613-632, 2003.
15. M. Grohe and S. Wöhrle. An existential locality theorem. Annals of Pure and Applied Logic, 129:131-148, 2004.
16. H. J. Keisler and W. B. Lotfallah. Shrinking games and local formulas. Annals of Pure and Applied Logic, 128:215-225, 2004.
17. S. Khanna and R. Motwani. Towards a syntactic characterization of PTAS. In Proc. of STOC'96, pages 329-337, 1996.
18. P. Kolaitis and M. Thakur. Logical definability of NP optimization problems. Information and Computation, 115(2):321-353, 1994.
19. P. Kolaitis and M. Thakur. Approximation properties of NP minimization classes. Journal of Computer and System Sciences, 50:391-411, 1995.
20. R. Lipton and R. Tarjan. A separator theorem for planar graphs. SIAM J. on Applied Mathematics, 36:177-189, 1979.
21. D. Marx. Parameterized complexity and approximation algorithms, 2006.
22. C. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 43:425-440, 1991.
23. N. Robertson and P. Seymour. Graph minors I-XX. App. in Journal of Combinatorial Theory, Series B since 1982.
24. R. Thomas. Recent excluded minor theorems. In Surveys in Combinatorics, LMS Lecture Note Series. Cambridge University Press, 1999.