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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of combinatorial optimization Ročník 41; číslo 1; s. 128 - 142
Hlavní autoři:	Shi, Majun, Yang, Zishen, Kim, Donghyun, Wang, Wei
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.01.2021 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!