Abstract
IN THE previous two chapters we have seen examples of Npo problems that can be approximated either within a specific constant factor or within any constant factor. We also saw examples of Npo problems for which no approximation algorithm exists (unless P=Np) and examples of Npo problems for which an approximation algorithm but no approximation scheme exists (unless P=Np). To deal with these two latter kinds of problem, in this chapter we will relax the constraint on the performance ratio in two ways.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ausiello, G., Marchetti-Spaccamela, A., Crescenzi, P., Gambosi, G., Protasi, M., Kann, V. (1999). Input-Dependent and Asymptotic Approximation. In: Complexity and Approximation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58412-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-58412-1_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63581-6
Online ISBN: 978-3-642-58412-1
eBook Packages: Springer Book Archive