Greedy Strategy

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 2 in Design and Analysis of Approximation Algorithms, 2012, pp 35-80 from Springer

Abstract: Abstract The greedy strategy is a simple and popular idea in the design of approximation algorithms. In this chapter, we study two general theories, based on the notions of independent systems and submodular potential functions, about the analysis of greedy algorithms, and present a number of applications of these methods.

Keywords: Greedy Algorithm; Vertex Cover; Performance Ratio; Independent System; Submodular Function (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_2

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

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

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