Completeness in approximation classes beyond APX
暂无分享,去创建一个
[1] Luca Trevisan,et al. Structure in Approximation Classes , 1999, Electron. Colloquium Comput. Complex..
[2] P. Orponen,et al. On Approximation Preserving Reductions: Complete Problems and Robust Measures (Revised Version) , 1987 .
[3] Rajeev Motwani,et al. On syntactic versus computational views of approximability , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[4] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[5] Alessandro Panconesi,et al. Completeness in Approximation Classes , 1989, Inf. Comput..
[6] Peter Slavík. A Tight Analysis of the Greedy Algorithm for Set Cover , 1997, J. Algorithms.
[7] Giorgio Gambosi,et al. Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .
[8] Carsten Lund,et al. Proof verification and the intractability of approximation problems , 1992, FOCS 1992.
[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[10] Teofilo F. Gonzalez,et al. P-Complete Approximation Problems , 1976, J. ACM.
[11] Ran Raz,et al. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.
[12] Noga Alon,et al. Derandomized graph products , 1995, computational complexity.
[13] Vangelis Th. Paschos,et al. Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness , 2005, Theor. Comput. Sci..
[14] Luca Trevisan,et al. On Approximation Scheme Preserving Reducibility and Its Applications , 2000, Theory Comput. Syst..
[15] Madhu Sudan,et al. Improved Low-Degree Testing and its Applications , 2003, Comb..