On parameterized approximability

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

Volumn 4169 LNCS, Issue , 2006, Pages 109-120

  Chen, Yijia ^a   Grohe, Martin ^b   Grüber, Magdalena ^b  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PROBLEM SOLVING;

COST SOLUTIONS; PARAMETERIZED APPROXIMABILITY;

APPROXIMATION THEORY;

EID: 33750263582     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11847250_10     Document Type: Conference Paper

References (20)

1. S. Arora and S. Safra. Probabilistic checking of proofs: a new characterization of NP. Journal of the ACM, 45(1), pages 70-122, 1998.
2. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation. Springer-Verlag, 2003.
3. L. Cai, J. Chen, R.G. Downey, and M.R. Fellows. On the parameterized complexity of short computation and factorization. Archive for Mathematical Logic, 36:321-337, 1997.
4. L. Cai and X. Huang. Fixed-Parameter Approximation: Conceptual Framework and Approximability Results. These proceedings.
5. M. Cesati and M. Di Ianni. Computation models for parameterized complexity. Mathematical Logic Quarterly, 43:179-202, 1997.
6. J. Chen, B. Chor, M. Fellows, X. Huang, D. Juedes, I. Kanj, and G. Xia. Tight lower bounds for certain parameterized NP-hard problems. Proceedings of the 19th IEEE Conference on Computational Complexity, pages 150-160, 2004.
7. B. Courcelle, J. Engelfriet, and G. Rozenberg. Context-free handle-rewriting hypergraph grammars. In H. Ehrig, H.-J. Kreowski, and G. Rozenberg, editors, Graph-Grammars and their Application to Computer Science, 4th International Workshop, Proceedings, volume 532 of Lecture Notes in Computer Science, pages 253-268, 1991.
8. I. Dinur. The PCP theorem by gap amplification. Proceedings of STOC 2006, 38th ACM Symposium on Theory of Computing, Seattle, Washington, USA, to appear.
9. R.G. Downey and M.R. Fellows. Fixed-parameter tractability and completeness II: On completeness for W[1]. Journal of Theoretical Computer Science, volume 141, pages 109-131, 1995.
10. R.G. Downey and M.R. Fellows. Parameterized Complexity. Springer-Verlag, 1999.
11. R.G. Downey, M.R. Fellows, and C. McCartin. Parameterized Approximation Algorithms. These proceedings.
12. G. Even, J. S. Naor, B. Schieber, and M. Sudan. Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica, 20(2):151-174, 1998.
13. M. Fellows, F. Rosamond, U. Rotics, and S. Szeider. Clique-width minimization is NP-hard. Proceedings of STOC 2006, 38th ACM Symposium on Theory of Computing, Seattle, Washington, USA, to appear.
14. J. Flum and M. Grohe. Parameterized Complexity Theory. Springer-Verlag, 2006.
15. 1-ε. Electronic Colloquium on Computational Complexity, Report TR97-038, 1997.
16. S. Oum. Approximating rank-width and clique-width quickly. 31th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2005, volume 3787 of Lecture Notes in Computer Science, pages 49-58, 2005.
17. S. Oum and P. Seymour. Approximating clique-width and branch-width. Journal of Combinatorial Theory, Series B, to appear.
18. B. Reed, N. Robertson, P. Seymour, and R. Thomas. Packing directed circuits. Combinatorica, 16(4):535-554, 1996.
19. P. Seymour. Packing directed circuits fractionally. Combinatorica, 15(2):281-288, 1995.
20. A. Slivkins. Parameterized tractability of edge-disjoint paths on directed acyclic graphs. In G. D. Battista and U. Zwick editors, Proceedings of 11th Annual European Symposium on Algorithms, ESA'03, volume 2832 of Lecture Notes in Computer Science, pages 482-493, 2003.