On the longest circuit in an alterable digraph
暂无分享,去创建一个
[1] David R. Karger,et al. On Approximating the Longest Path in a Graph (Preliminary Version) , 1993, WADS.
[2] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] K. Ko,et al. On the Complexity of Min-Max Optimization Problems and their Approximation , 1995 .
[5] Sanjeev Arora,et al. Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[6] Joan Feigenbaum,et al. Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions , 1993, STOC.
[7] Miklós Ajtai,et al. Recursive construction for 3-regular expanders , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[8] Mihalis Yannakakis,et al. The Traveling Salesman Problem with Distances One and Two , 1993, Math. Oper. Res..
[9] Larry J. Stockmeyer,et al. The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..
[10] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[11] Carsten Lund,et al. On the hardness of approximating minimization problems , 1993, STOC.