A Unified Continuous Greedy Algorithm for Submodular Maximization

The study of combinatorial problems with a submodular objective function has attracted much attention in recent years, and is partly motivated by the importance of such problems to economics, algorithmic game theory and combinatorial optimization. Classical works on these problems are mostly combina...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	2011 IEEE 52nd Annual Symposium on Foundations of Computer Science S. 570 - 579
Hauptverfasser:	Feldman, Moran, Naor, Joseph, Schwartz, Roy
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.10.2011
Schlagworte:	Algorithm design and analysis Approximation Approximation algorithms Approximation methods Continuous Greedy Greedy algorithms Max-SAT Optimized production technology Submodular Submodular Welfare Vectors
ISBN:	145771843X, 9781457718434
ISSN:	0272-5428
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!