Unified greedy approximability beyond submodular maximization

We consider classes of objective functions of cardinality constrained maximization problems for which the greedy algorithm guarantees a constant approximation. We propose the new class of $\gamma$-$\alpha$-augmentable functions and prove that it encompasses several important subclasses, such as func...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Disser, Yann, Weckbecker, David
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Discrete Mathematics Mathematics - Optimization and Control
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!