Restriction

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 3 in Design and Analysis of Approximation Algorithms, 2012, pp 81-122 from Springer

Abstract: 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.

Keywords: Span Tree; Greedy Algorithm; Minimum Span Tree; Steiner Tree; Performance Ratio (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_3

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

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

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 ().