Fast deterministic algorithms for non-submodular maximization with strong performance guarantees

We study the non-submodular maximization problem, in which the objective function is characterized by parameters, subject to a cardinality or p -system constraint. By adapting the Threshold-Greedy algorithm for the submodular maximization, we present two deterministic algorithms for approximately so...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of global optimization Jg. 89; H. 3; S. 777 - 801
Hauptverfasser:	Lu, Cheng, Yang, Wenguo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.07.2024 Springer Springer Nature B.V
Schlagworte:	Algorithms Analysis Approximation Computer Science Greedy algorithms Mathematics Mathematics and Statistics Maximization Operations Research/Decision Theory Optimization Real Functions Greedy algorithm Non-submodular maximization Independence system Curvature
ISSN:	0925-5001, 1573-2916
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!