Fast algorithms for maximizing monotone nonsubmodular functions

In recent years, with the more and more researchers studying the problem of maximizing monotone (nonsubmodular) objective functions, the approximation algorithms for this problem have gotten much progress by using some interesting techniques. In this paper, we develop the approximation algorithms fo...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of combinatorial optimization Vol. 43; no. 5; pp. 1655 - 1670
Main Authors:	Liu, Bin, Hu, Miaomiao
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.07.2022 Springer Nature B.V
Subjects:	Approximation Combinatorics Convex and Discrete Geometry Greedy algorithms Mathematical analysis Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Maximization Operations Research/Decision Theory Optimization Queries Theory of Computation Nonsubmodular Function Matroid constraint Approximation algorithm Cardinality constraint
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!