Non-monotone submodular function maximization under k-system constraint

The problems of maximizing constrained monotone submodular functions have many practical applications, most recently in the context of combinatorial optimization, operations research, economics and especially machine learning, with constant approximation algorithms known under a variety of constrain...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of combinatorial optimization Vol. 41; no. 1; pp. 128 - 142
Main Authors:	Shi, Majun, Yang, Zishen, Kim, Donghyun, Wang, Wei
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.01.2021 Springer Nature B.V
Subjects:	Algorithms Approximation Combinatorial analysis Combinatorics Computer science Constraints Convex and Discrete Geometry Economics Foundations Greedy algorithms Machine learning Mathematical analysis Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Maximization Operations research Operations Research/Decision Theory Optimization Run time (computers) Theory of Computation Modified-Greedy algorithm system Submodular maximization NMSFMk algorithm
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!