Approximation of natural W[P]-complete minimisation problems is hard

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2008, Pages 8-18

  Eickmeyer, Kord ^a   Grohe, Martin ^a   Grüber, Magdalena ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; MATHEMATICAL TECHNIQUES; PARAMETER ESTIMATION; POLYNOMIAL APPROXIMATION;

INAPPROXIMABILITY; SATISFIABILITY PROBLEM;

APPROXIMATION ALGORITHMS;

EID: 51749087932     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2008.24     Document Type: Conference Paper

References (14)

1. K. A. Abrahamson, R. G. Downey, and M. R. Fellows. Fixed-parameter tractability and completeness IV: On completeness for W|P] and PS PACK analogues. Annals of Pure and Applied Logic, 73:235-276, 1995.
2. M. Alekhnovich and A. Razborov. Resolution is not automatizable unless W[P] is tractable. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pages 210-219, 2001.
3. H. Buhrman, P. B. Miltersen, J. Radhakrishnan, and S. Venkatesh. Are bitvectors optimal? In STOC'00: Proceedings of the thirty-second annual ACM symposium on Theory of computing, pages 449-458, New York, NY, USA, 2000. ACM.
4. L. Cai and X. Huang. Fixed-parameter approximation: Conceptual framework and approximability results. In Proceedings of the 2nd International Workshop on Parameterized and Exact Computation, volume 4169 of LNCS, pages 96-108. Springer-Verlag, 2006.
5. M. Capalbo. O. Reingold, S. Vadhan, and A. Wigderson. Randomness conductors and constant-degree lossless expanders. In CCC'02: Proceedings of the 17th IEEE Annual Conference on Computational Complexity, page 15, Washington, DC, USA, 2002. IEEE Computer Society.
6. Y. Chen, J. Flum, and M. Grohe. Machine-based methods in parameterized complexity theory. Theoretical Computer Science, 339:167-199, 2005.
7. Y. Chen, M. Grohe, and M. Grüber. On parameterized approximability. In Proceedings of the 2nd International Workshop on Parameterized and Exact Computation, volume 4169 of LNCS, pages 109-120. Springer-Verlag, 2006.
8. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, New York, 1999.
9. R. G. Downey, M. R. Fellows, and C. McCaitin. Parameterized approximation algorithms. In Proceedings of the 2nd International Workshop on Parameterized and Exact Computation, volume 4169 of LNCS, pages 121-129. Springcr-Verlag, 2006.
10. J. Flum and M. Grohe. Parameterized Complexity Theory. Springer-Verlag, Berlin Heidelberg, 2006.
11. V. Guruswami, C. Umans, and S. Vadhan. Unbalanced expanders and randomness extractors from parvaresh-vardy codes. ccc, 00:96-108, 2007.
12. B. Manthey and R. Reischuk. The intractability of computing the hamming distance. Theoretical Computer Science, 337(1-3):331-346, 2005.
13. T. Mielikäinen and E. Ukkonen. The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization. Discrete Applied Mathematics, 154(4): 684-691, 2006.
14. N. Nisan and A. Wigderson. Hardness vs. randomness. In 29th Annual Symposium on Foundations of Computer Science, pages 2-11, 1988.