Relaxation

Ding-Zhu Du (), Ker-I Ko () and Xiaodong Hu ()
Additional contact information
Ding-Zhu Du: University of Texas at Dallas
Ker-I Ko: State University of New York at Stony Brook
Xiaodong Hu: Academy of Mathematics and Systems Science Chinese Academy of Sciences

Chapter 6 in Design and Analysis of Approximation Algorithms, 2012, pp 211-244 from Springer

Abstract: Abstract An optimization problem asks for a solution from a given feasible domain that provides the optimal value of a given objective function. The technique of relaxation is, contrary to the technique of restriction, to relax some constraints on the feasible solutions and, hence, enlarge the feasible domain so that an optimal or a good approximate solution to the relaxed version of the problemcan be found in polynomial time. This optimal or approximate solution to the relaxed version is not necessarily feasible for the original problem, and we may need to modify it to get a feasible solution to the original input. This modification step often requires special tricks and is an important part of the relaxation technique.

Keywords: Greedy Algorithm; Travel Salesman Problem; Steiner Tree; Input Graph; White Vertex (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-1-4614-1701-9_6

Ordering information: This item can be ordered from
http://www.springer.com/9781461417019

DOI: 10.1007/978-1-4614-1701-9_6

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().