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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of combinatorial optimization Vol. 44; no. 5; pp. 3549 - 3574
Main Authors:	Zhang, Xiaojuan, Liu, Qian, Li, Min, Zhou, Yang
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.12.2022 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!