2012 | OriginalPaper | Chapter
Greedy Strategy
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
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.