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

Full description

Bibliographic Details

Published in:	2011 IEEE 52nd Annual Symposium on Foundations of Computer Science pp. 570 - 579
Main Authors:	Feldman, Moran, Naor, Joseph, Schwartz, Roy
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.10.2011
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!