Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy

In this paper, we concentrate on exploring fast algorithms for the minimization of a non-increasing supermodular or non-supermodular function f subject to a cardinality constraint. As for the non-supermodular minimization problem with the weak supermodularity ratio r , we can obtain a ( 1 + ϵ ) -app...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of combinatorial optimization Ročník 44; číslo 5; s. 3549 - 3574
Hlavní autori:	Zhang, Xiaojuan, Liu, Qian, Li, Min, Zhou, Yang
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.12.2022 Springer Nature B.V
Predmet:	Algorithms Approximation Combinatorics Convex and Discrete Geometry Criteria Mathematical analysis Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Theory of Computation Supermodular 68Q25 Non-supermodular Bi-criteria 68W10 Fuzzy means problem 90C27 68W25 Group sparse linear regression problem
ISSN:	1382-6905, 1573-2886
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!