A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint

• Published in: Information processing letters Vol. 163; p. 106010
• Main Authors: Amanatidis, Georgios, Birmpas, Georgios, Markakis, Evangelos
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.11.2020
• Subjects: Approximation algorithms; Knapsack constraints; Submodular maximization; Symmetric submodular functions; Symmetric submodular functions; Approximation algorithms; Knapsack constraints; Submodular maximization

We obtain a polynomial-time deterministic (2ee−1+ϵ)-approximation algorithm for maximizing symmetric submodular functions under a budget constraint. Although there exist randomized algorithms with better expected performance, our algorithm achieves the best known factor achieved by a deterministic a...