A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint

We present an optimal, combinatorial 1-1/e approximation algorithm for monotone sub modular optimization over a matroid constraint. Compared to the continuous greedy algorithm (Calinescu, Chekuri, Pal and Vondrak, 2008), our algorithm is extremely simple and requires no rounding. It consists of the...

Full description

Saved in:

Bibliographic Details
Published in:	2012 IEEE 53rd Annual Symposium on Foundations of Computer Science pp. 659 - 668
Main Authors:	Filmus, Y., Ward, J.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.10.2012
Subjects:	Algorithm design and analysis Approximation algorithms Approximation methods Greedy algorithms Linear programming local search matroids Search problems submodular functions
ISBN:	1467343838, 9781467343831
ISSN:	0272-5428
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!