On the Complexity of Min-Max Optimization Problems and their Approximation
暂无分享,去创建一个
[1] Larry J. Stockmeyer,et al. The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] Mihalis Yannakakis,et al. Equivalences Among Relational Expressions with the Union and Difference Operators , 1980, J. ACM.
[4] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[5] Viggo Kann,et al. Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete , 1991, Inf. Process. Lett..
[6] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[7] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[8] Mihalis Yannakakis,et al. The Traveling Salesman Problem with Distances One and Two , 1993, Math. Oper. Res..
[9] Joan Feigenbaum,et al. Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions , 1993, STOC.
[10] Carsten Lund,et al. Alternation in interaction , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.
[11] Chih-Long Lin,et al. On the longest circuit in an alterable digraph , 1995, J. Glob. Optim..