Approximability of hard combinatorial optimization problems: an introduction
暂无分享,去创建一个
[1] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[2] Francesco Maffioli,et al. A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem , 1994, Inf. Process. Lett..
[3] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[4] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..
[5] Rainer Schrader,et al. ON THE EXISTENCE OF FAST APPROXIMATION SCHEMES , 1981 .
[6] Oscar H. Ibarra,et al. Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.
[7] Francesco Maffioli,et al. On the Approximability of Some Maximum Spanning Tree Problems , 1997, Theor. Comput. Sci..
[8] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[9] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[10] Alan M. Frieze,et al. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem , 1982, Networks.
[11] László Lovász,et al. Approximating clique is almost NP-complete , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[12] David S. Johnson,et al. `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.
[13] Phokion G. Kolaitis,et al. Logical Definability of NP Optimization Problems , 1994, Inf. Comput..
[14] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[15] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[16] Carsten Lund,et al. On the hardness of approximating minimization problems , 1994, JACM.
[17] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[18] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[19] Shlomo Moran,et al. Non Deterministic Polynomial Optimization Problems and their Approximations , 1977, Theor. Comput. Sci..
[20] Giorgio Ausiello,et al. Theoretical Computer Science Approximate Solution of Np Optimization Problems * , 2022 .
[21] Giorgio Ausiello,et al. Structure Preserving Reductions among Convex Optimization Problems , 1980, J. Comput. Syst. Sci..
[22] Teofilo F. Gonzalez,et al. P-Complete Approximation Problems , 1976, J. ACM.
[23] David S. Johnson,et al. The Complexity of Near-Optimal Graph Coloring , 1976, J. ACM.
[24] Sartaj Sahni,et al. Approximate Algorithms for the 0/1 Knapsack Problem , 1975, JACM.