Approximation properties of NP minimization classes
暂无分享,去创建一个
[1] Paul Young,et al. A Structural Overview of NP Optimization Problems , 1989, Optimal Algorithms.
[2] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[3] Mihalis Yannakakis,et al. Edge-Deletion Problems , 1981, SIAM J. Comput..
[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[5] Desh Ranjan,et al. Quantifiers and approximation , 1990, STOC '90.
[6] Daniel J. Moore,et al. Optimization Problems and the Polynomial Hierarchy , 1981, Theor. Comput. Sci..
[7] Mihalis Yannakakis,et al. Node-Deletion Problems on Bipartite Graphs , 1981, SIAM J. Comput..
[8] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.