@inproceedings{366a00acec1f4ab6bc48034985718f3e,
title = "Guess free maximization of submodular and linear sums",
abstract = "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. [16] described an algorithm for this problem whose approximation guarantee is optimal in some intuitive and formal senses. Unfortunately, this algorithm involves a guessing step which makes it less clean and significantly affects its time complexity. In this work we describe a clean alternative algorithm that uses a novel weighting technique in order to avoid the problematic guessing step while keeping the same approximation guarantee as the algorithm of [16].",
keywords = "Continuous greedy, Curvature, Submodular maximization",
author = "Moran Feldman",
note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2019.; 16th International Symposium on Algorithms and Data Structures, WADS 2019 ; Conference date: 05-08-2019 Through 07-08-2019",
year = "2019",
doi = "10.1007/978-3-030-24766-9_28",
language = "American English",
isbn = "9783030247652",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "380--394",
editor = "Zachary Friggstad and Salavatipour, {Mohammad R.} and J{\"o}rg-R{\"u}diger Sack",
booktitle = "Algorithms and Data Structures - 16th International Symposium, WADS 2019, Proceedings",
address = "Germany",
}