A refined analysis of submodular Greedy

Ariel Kulik; Roy Schwartz; Hadas Shachnai

doi:10.1016/j.orl.2021.04.006

A refined analysis of submodular Greedy

Ariel Kulik, Roy Schwartz, Hadas Shachnai

Computer Science

Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

Many algorithms for maximizing a monotone submodular function subject to a knapsack constraint rely on the natural greedy heuristic. We present a novel refined analysis of this greedy heuristic which enables us to: (1) reduce the enumeration in the tight (1−e⁻¹)-approximation of [Sviridenko 04] from subsets of size three to two; (2) present an improved upper bound of 0.42945 for the classic algorithm which returns the better between a single element and the output of the greedy heuristic.

Original language	American English
Pages (from-to)	507-514
Number of pages	8
Journal	Operations Research Letters
Volume	49
Issue number	4
DOIs	https://doi.org/10.1016/j.orl.2021.04.006
State	Published - 1 Jul 2021

Keywords

Approximation algorithms
Knapsack constraint
Submodular functions

All Science Journal Classification (ASJC) codes

Software
Management Science and Operations Research
Industrial and Manufacturing Engineering
Applied Mathematics

Access to Document

10.1016/j.orl.2021.04.006

Cite this

@article{d59a67acd4834095a191e9cb51036290,

title = "A refined analysis of submodular Greedy",

abstract = "Many algorithms for maximizing a monotone submodular function subject to a knapsack constraint rely on the natural greedy heuristic. We present a novel refined analysis of this greedy heuristic which enables us to: (1) reduce the enumeration in the tight (1−e−1)-approximation of [Sviridenko 04] from subsets of size three to two; (2) present an improved upper bound of 0.42945 for the classic algorithm which returns the better between a single element and the output of the greedy heuristic.",

keywords = "Approximation algorithms, Knapsack constraint, Submodular functions",

author = "Ariel Kulik and Roy Schwartz and Hadas Shachnai",

note = "Publisher Copyright: {\textcopyright} 2021 The Authors",

year = "2021",

month = jul,

day = "1",

doi = "10.1016/j.orl.2021.04.006",

language = "American English",

volume = "49",

pages = "507--514",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "4",

}

TY - JOUR

T1 - A refined analysis of submodular Greedy

AU - Kulik, Ariel

AU - Schwartz, Roy

AU - Shachnai, Hadas

PY - 2021/7/1

Y1 - 2021/7/1

N2 - Many algorithms for maximizing a monotone submodular function subject to a knapsack constraint rely on the natural greedy heuristic. We present a novel refined analysis of this greedy heuristic which enables us to: (1) reduce the enumeration in the tight (1−e−1)-approximation of [Sviridenko 04] from subsets of size three to two; (2) present an improved upper bound of 0.42945 for the classic algorithm which returns the better between a single element and the output of the greedy heuristic.

AB - Many algorithms for maximizing a monotone submodular function subject to a knapsack constraint rely on the natural greedy heuristic. We present a novel refined analysis of this greedy heuristic which enables us to: (1) reduce the enumeration in the tight (1−e−1)-approximation of [Sviridenko 04] from subsets of size three to two; (2) present an improved upper bound of 0.42945 for the classic algorithm which returns the better between a single element and the output of the greedy heuristic.

KW - Approximation algorithms

KW - Knapsack constraint

KW - Submodular functions

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

U2 - 10.1016/j.orl.2021.04.006

DO - 10.1016/j.orl.2021.04.006

M3 - Article

SN - 0167-6377

VL - 49

SP - 507

EP - 514

JO - Operations Research Letters

JF - Operations Research Letters

IS - 4

ER -

A refined analysis of submodular Greedy

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this