Deterministic (1/2 + ε)-approximation for submodular maximization over a matroid

Niv Buchbinder; Moran Feldman; Mohit Garg

Deterministic (¹/2 + ε)-approximation for submodular maximization over a matroid

Niv Buchbinder, Moran Feldman, Mohit Garg

Research output: Contribution to conference › Paper › peer-review

Abstract

We study the problem of maximizing a monotone submodular function subject to a matroid constraint and present a deterministic algorithm that achieves (¹/2 + ε)-approximation for the problem. This algorithm is the first deterministic algorithm known to improve over the ¹/2-approximation ratio of the classical greedy algorithm proved by Nemhauser, Wolsely and Fisher in 1978.

Original language	English
Pages	241-254
Number of pages	14
State	Published - 2019
Externally published	Yes
Event	30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019 - San Diego, United States Duration: 6 Jan 2019 → 9 Jan 2019

Conference

Conference	30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019
Country/Territory	United States
City	San Diego
Period	6/01/19 → 9/01/19

Bibliographical note

Publisher Copyright:
Copyright © 2019 by SIAM.

Keywords

Deterministic algorithms
Matroid
Submodular optimization

ASJC Scopus subject areas

Software
General Mathematics

Cite this

@conference{6681418c4b92431595e3d661e5acf08b,

title = "Deterministic (1/2 + ε)-approximation for submodular maximization over a matroid",

abstract = "We study the problem of maximizing a monotone submodular function subject to a matroid constraint and present a deterministic algorithm that achieves (1/2 + ε)-approximation for the problem. This algorithm is the first deterministic algorithm known to improve over the 1/2-approximation ratio of the classical greedy algorithm proved by Nemhauser, Wolsely and Fisher in 1978.",

keywords = "Deterministic algorithms, Matroid, Submodular optimization",

author = "Niv Buchbinder and Moran Feldman and Mohit Garg",

note = "Publisher Copyright: Copyright {\textcopyright} 2019 by SIAM.; 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019 ; Conference date: 06-01-2019 Through 09-01-2019",

year = "2019",

language = "English",

pages = "241--254",

}

TY - CONF

T1 - Deterministic (1/2 + ε)-approximation for submodular maximization over a matroid

AU - Buchbinder, Niv

AU - Feldman, Moran

AU - Garg, Mohit

PY - 2019

Y1 - 2019

N2 - We study the problem of maximizing a monotone submodular function subject to a matroid constraint and present a deterministic algorithm that achieves (1/2 + ε)-approximation for the problem. This algorithm is the first deterministic algorithm known to improve over the 1/2-approximation ratio of the classical greedy algorithm proved by Nemhauser, Wolsely and Fisher in 1978.

AB - We study the problem of maximizing a monotone submodular function subject to a matroid constraint and present a deterministic algorithm that achieves (1/2 + ε)-approximation for the problem. This algorithm is the first deterministic algorithm known to improve over the 1/2-approximation ratio of the classical greedy algorithm proved by Nemhauser, Wolsely and Fisher in 1978.

KW - Deterministic algorithms

KW - Matroid

KW - Submodular optimization

UR - http://www.scopus.com/inward/record.url?scp=85065895374&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:85065895374

SP - 241

EP - 254

T2 - 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019

Y2 - 6 January 2019 through 9 January 2019

ER -