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

Celý popis

Podrobná bibliografia

Vydané v:	2011 IEEE 52nd Annual Symposium on Foundations of Computer Science s. 570 - 579
Hlavní autori:	Feldman, Moran, Naor, Joseph, Schwartz, Roy
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.10.2011
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!