Abstract
The basic idea of partition is to divide the input object into smaller parts so that each part has a simple solution, and a feasible solution to the input instance can be constructed by combining the solutions of the smaller parts. The method of partition can be seen as a special form of restriction; that is, we restrict our attention to the feasible solutions that can be constructed through partitions.
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). Partition. 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_4
Download citation
DOI: https://doi.org/10.1007/978-1-4614-1701-9_4
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)