Guess free maximization of submodular and linear sums

DOI10.1007/978-3-030-24766-9_28OpenAlexW2964899188MaRDI QIDQ5919316

Moran Feldman

Publication date: 16 January 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.03813

zbMATH Keywords

curvaturesubmodular maximizationcontinuous greedy

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Related Items (6)

On maximizing the difference between an approximately submodular function and a linear function subject to a matroid constraint ⋮ A multi-pass streaming algorithm for regularized submodular maximization ⋮ Bicriteria algorithms for maximizing the difference between submodular function and linear function under noise ⋮ Bicriteria algorithms to balance coverage and cost in team formation under online model ⋮ Online bicriteria algorithms to balance coverage and cost in team formation ⋮ Bicriteria streaming algorithms to balance gain and cost with cardinality constraint

This page was built for publication: Guess free maximization of submodular and linear sums