Abstract
We investigate a large class of NP optimization problems which we call MNP. We show that Rmax(2) [PR] are in our class and some problems which are not likely in Rmax(2) are in our class. We also define a new kind of reductions, WL-reductions, to preserve approximability and unapproximability, so it is more general version of L-reductions[PY] and A-reductions [PR]. Then we show some complete problems of this class under WL-reductions and prove that the maxclique problem is one of them. So all complete problems in this class are as difficult to approximate as the max-clique problem.
This work is supported under the National Science Fundation of China grant 69073303 and National High Technology Projection of China grant 863-306-05-03-04.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof Verification and Hardness of Approximation Problems. Proc. 33 FOCS, 1992.
S. Arora and S. Safra, Probabilistic Checking of Proofs: A New Characterization of NP. Proc. 33 FOCS, 1992.
M. Bellare, S. Goldwasser, C. Lund and A. Russell, Efficient Probabilistically Checkable Proofs and Applications to Approximation, 25th STOC, 1993
R. B. Boppana and M. M. Halldórsson, Approximating maximum independent set by excluding subgraphs, In Proc. of 2nd Scand. Workshop on Algorithm Theory, Springer-Verlag, Lecture Notes in Computer Science 447, 1990.
R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, in “Complexity of Computations”, AMS, 1974.
U. Feige, S. Goldwasser, L. Lovász, S. Safra and M. Szegezy, Approximating clique is almost NP-hard. Proc. 32nd FOCS, 1991.
M. R. Garey and D. S. Johnson, Computers and Intractability, W. H. Freeman and Company,1979.
R. M. Karp, Reducibility among combinatorial problems, In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, Plenum Press, 1972.
A. Panconesi and D. Ranjan, Quantifiers and Approximation, 22nd STOC, 446–456, 1990.
C. H. Papadimitriou and M. Yannakakis. Optimization, Approximation, and Complexity Classes. Journal of Computer and System Sciences, vol. 43, 1991
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheng, Q., Zhu, H. (1995). MNP: A class of NP optimization problems. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030877
Download citation
DOI: https://doi.org/10.1007/BFb0030877
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60216-3
Online ISBN: 978-3-540-44733-7
eBook Packages: Springer Book Archive