共 17 条
[1]
Alimonti, New local search approximation techniques for maximum generalized satisfiability problems, Proc. 2nd Italian Conf. on Algorithms and Complexity, 778, pp. 40-53, (1994)
[2]
Arora, Lund, Motwani, Sudan, Szegedy, Proof verification and hardness of approximation problems, Proc. 33rd IEEE Symp. on Foundations of Computer Science, pp. 14-23, (1992)
[3]
Ausiello, Crescenzi, Protasi, Approximate solution of NP optimization problems, Theoret. Comput. Sci., (1995)
[4]
Ausiello, D'Atri, Protasi, Structure preserving reductions among convex optimization problems, Journal of Computer and System Sciences, 21, pp. 136-153, (1980)
[5]
Ausiello, Marchetti-Spaccamela, Protasi, Toward a unified approach for the classification of NP-complete problems, Theoretical Computer Science, 12, pp. 83-96, (1980)
[6]
Bruschi, Joseph, Young, A structural overview of NP optimization problems, Algorithms Review, 2, pp. 1-26, (1991)
[7]
Crescenzi, Panconesi, Completeness in approximation classes, Inform. and Comput., 93, pp. 241-262, (1991)
[8]
Crescenzi, Trevisan, On approximation scheme preserving reducibility and its applications, Proc. 14th Conf. on Foundations of Software Technology and Theoretical Computer Science, 880, pp. 330-341, (1994)
[9]
Garey, Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, (1979)
[10]
Johnson, Papadimitriou, Yannakakis, How easy is local search?, J. Comput. System Sci., 37, pp. 79-100, (1988)