DETERMINISTIC (1/2+ϵ)-APPROXIMATION FOR SUBMODULAR MAXIMIZATION OVER A MATROID

Niv Buchbinder; Moran Feldman; Mohit Garg

doi:https://doi.org/10.1137/19M125515X

DETERMINISTIC (1/2+ϵ)-APPROXIMATION FOR SUBMODULAR MAXIMIZATION OVER A MATROID

Niv Buchbinder, Moran Feldman, Mohit Garg

Tel Aviv University, Open University of Israel

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

Keywords

deterministic algorithms
matroid
submodular optimization

All Science Journal Classification (ASJC) codes

General Computer Science
General Mathematics

Access to Document

https://doi.org/10.1137/19M125515X

Cite this

@article{607abc3b6ab944278767c16f032ef05a,

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 (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 = "https://doi.org/10.1137/19M125515X",

language = "الإنجليزيّة",

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 (1/2+ϵ)-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 - http://www.scopus.com/inward/record.url?scp=85170829372&partnerID=8YFLogxK

U2 - https://doi.org/10.1137/19M125515X

DO - https://doi.org/10.1137/19M125515X

M3 - مقالة

SN - 0097-5397

VL - 52

SP - 945

EP - 967

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 4

ER -

DETERMINISTIC (1/2+ϵ)-APPROXIMATION FOR SUBMODULAR MAXIMIZATION OVER A MATROID

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this