Abstract
When we design an approximate algorithm by the restriction method, we add some constraints on an optimization problem to shrink the feasible domain so that the optimization problemon the resulting domain becomes easier to solve or approximate. We may then use the optimal or approximate solutions for this restricted problem to approximate the original problem.
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
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Du, DZ., Ko, KI., Hu, X. (2012). Restriction. In: Design and Analysis of Approximation Algorithms. Springer Optimization and Its Applications(), vol 62. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-1701-9_3
Download citation
DOI: https://doi.org/10.1007/978-1-4614-1701-9_3
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-1700-2
Online ISBN: 978-1-4614-1701-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)