Approximation thresholds for combinatorial optimization problems
暂无分享,去创建一个
[1] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] László Lovász,et al. Approximating Min Sum Set Cover , 2004, Algorithmica.
[4] A. Frieze,et al. A simple heuristic for the p-centre problem , 1985 .
[5] Sanjeev Arora. How NP got a new definition: a survey of probabilistically checkable proofs , 2003, ArXiv.
[6] D. Hochbaum,et al. A best possible approximation algorithm for the k--center problem , 1985 .
[7] Jonas Holmerin. Vertex cover on 4-regular hyper-graphs is hard to approximate within 2 - ε , 2002, STOC '02.
[8] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .
[9] Randeep Bhatia,et al. Book review: Approximation Algorithms for NP-hard Problems. Edited by Dorit S. Hochbaum (PWS, 1997) , 1998, SIGA.
[10] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[11] Venkatesan Guruswami,et al. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 1999, STOC '99.
[12] Dorit S. Hochba,et al. Approximation Algorithms for NP-Hard Problems , 1997, SIGA.
[13] J. Håstad. Clique is hard to approximate within n 1-C , 1996 .
[14] Johan Håstad,et al. A well-characterized approximation problem , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.
[15] Lars Engebretsen,et al. Clique Is Hard To Approximate Within , 2000 .
[16] Uriel Feige,et al. Zero Knowledge and the Chromatic Number , 1998, J. Comput. Syst. Sci..
[17] Magnús M. Halldórsson,et al. Approximating the Minimum Maximal Independence Number , 1993, Inf. Process. Lett..
[18] Giorgio Gambosi,et al. Complexity and Approximation , 1999, Springer Berlin Heidelberg.
[19] Uri Zwick,et al. A 7/8-approximation algorithm for MAX 3SAT? , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[20] Giorgio Gambosi,et al. Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .
[21] Uriel Feige,et al. Approximating the domatic number , 2000, STOC '00.
[22] Uri Zwick,et al. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint , 1998, SODA '98.
[23] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[24] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[25] George L. Nemhauser,et al. Easy and hard bottleneck location problems , 1979, Discret. Appl. Math..