Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid.

Niv Buchbinder; Moran Feldman; Mohit Garg

doi:10.1137/19m125515x

Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid.

Niv Buchbinder, Moran Feldman, Mohit Garg

Research output: Contribution to journal › Article › 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 (1/2+ϵ)-approximation for the problem (for some ϵ ≥ 8 10-4). This algorithm is the first deterministic algorithm known to improve over the 1/2-approximation ratio of the classical greedy algorithm proved by Nemhauser, Wolsey, and Fisher in 1978.

Original language	English
Pages (from-to)	945-967
Number of pages	23
Journal	SIAM Journal on Computing
Volume	52
Issue number	4
DOIs	https://doi.org/10.1137/19m125515x
State	Published - 2023
Externally published	Yes

Bibliographical note

Publisher Copyright:
© 2023 Niv Buchbinder.

Keywords

deterministic algorithms
matroid
submodular optimization

ASJC Scopus subject areas

General Computer Science
General Mathematics

Access to Document

10.1137/19m125515x

Cite this

@article{151b58b752e44deba726acf59c15d091,

title = "Deterministic \textbackslash{}(\textbackslash{}boldsymbol\{(\textbackslash{}unicode\{x00BD\}+\textbackslash{}varepsilon)\}\textbackslash{}) -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 (for some ϵ ≥ 8 10-4). This algorithm is the first deterministic algorithm known to improve over the 1/2-approximation ratio of the classical greedy algorithm proved by Nemhauser, Wolsey, and Fisher in 1978.",

keywords = "deterministic algorithms, matroid, submodular optimization",

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

note = "Publisher Copyright: {\textcopyright} 2023 Niv Buchbinder.",

year = "2023",

doi = "10.1137/19m125515x",

language = "English",

volume = "52",

pages = "945--967",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "4",

}

TY - JOUR

T1 - Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid.

AU - Buchbinder, Niv

AU - Feldman, Moran

AU - Garg, Mohit

PY - 2023

Y1 - 2023

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 (for some ϵ ≥ 8 10-4). This algorithm is the first deterministic algorithm known to improve over the 1/2-approximation ratio of the classical greedy algorithm proved by Nemhauser, Wolsey, 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 (for some ϵ ≥ 8 10-4). This algorithm is the first deterministic algorithm known to improve over the 1/2-approximation ratio of the classical greedy algorithm proved by Nemhauser, Wolsey, and Fisher in 1978.

KW - deterministic algorithms

KW - matroid

KW - submodular optimization

UR - https://www.scopus.com/pages/publications/85170829372

U2 - 10.1137/19m125515x

DO - 10.1137/19m125515x

M3 - Article

AN - SCOPUS:85170829372

SN - 0097-5397

VL - 52

SP - 945

EP - 967

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 4

ER -

Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid.

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this