Abstract
We apply in the case of the maximum independent set, a general thought process consisting in integrating an information on the optimal objective value in its instance. This thought process for the study of the relative hardness between determining solutions of combinatorial optimization problems and computing (approximately or exactly) their optimal values, allows us to define classes of independent set problems the approximability of which is particularly interesting.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and intractability of approximation problems. Proc. FOCS (1992) 14–23
Ausiello, G., Crescenzi, P., Protasi, M.: Approximate solution of NP Optimization Problems. Theoretical Computer Science (to appear)
Berge, C.: Graphs and hypergraphs. North Holland (1973)
Bourjolly, J.-M., Hammer, P. L., Simeone, B.: Node-weighted graphs having the König-Egervary Property. Math. Prog. Study 22 (1984) 44–63
Demange, M., Paschos, V. Th.: On an approximation measure founded on the links between optimization and polynomial approximation theory. Theoretical Computer Science (to appear)
Demange, M., Paschos, V. Th.: The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems. Computational Optimization and Applications (to appear)
Demange, M., Paschos, V. Th.: Relative hardness of constructive — non-constructive approximation: the case of maximum independent set problem, manuscript, 1995.
Deming, R. W.: Independence numbers of graphs — an extension of the König-Egervary theorem. Disc. Math. 27 (1979) 23–33
Garey, M. R., Johnson, D. S.: Computers and intractability. A guide to the theory of NP-completeness. Freeman (1979)
Nemhauser, G. L. Trotter, Jr, L. E.: Vertex packings: structural properties and algorithms. Math. Prog. 8 (1975) 232–248
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Demange, M., Paschos, V.T. (1996). Constructive — non-constructive approximation and maximum independent set problem. In: Deza, M., Euler, R., Manoussakis, I. (eds) Combinatorics and Computer Science. CCS 1995. Lecture Notes in Computer Science, vol 1120. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61576-8_83
Download citation
DOI: https://doi.org/10.1007/3-540-61576-8_83
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61576-7
Online ISBN: 978-3-540-70627-4
eBook Packages: Springer Book Archive