Advertisement
Published in:
2012 | OriginalPaper | Chapter
Restriction
Authors : Ding-Zhu Du, Ker-I Ko, Xiaodong Hu
Published in: Design and Analysis of Approximation Algorithms
Publisher: Springer New York
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.