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...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of global optimization Ročník 89; číslo 3; s. 777 - 801
Hlavní autori:	Lu, Cheng, Yang, Wenguo
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.07.2024 Springer Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!