Guess Free Maximization of Submodular and Linear Sums

We consider the problem of maximizing the sum of a monotone submodular function and a linear function subject to a general solvable polytope constraint. Recently, Sviridenko et al. (Math Oper Res 42(4):1197–1218, 2017) described an algorithm for this problem whose approximation guarantee is optimal...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 83; číslo 3; s. 853 - 878
Hlavný autor:	Feldman, Moran
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.03.2021 Springer Nature B.V
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Algorithms and Data Structures (WADS 2019) Approximation Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Linear functions Mathematical analysis Mathematics of Computing Maximization Optimization Polytopes Theory of Computation 68Q25 Continuous greedy 68W25 90C27 Submodular maximization Curvature
ISSN:	0178-4617, 1432-0541
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!