Streaming submodular maximization under d-knapsack constraints

Submodular optimization is a key topic in combinatorial optimization, which has attracted extensive attention in the past few years. Among the known results, most of the submodular functions are defined on set. But recently some progress has been made on the integer lattice. In this paper, we study...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of combinatorial optimization Ročník 45; číslo 1; s. 15
Hlavní autoři:	Chen, Zihan, Liu, Bin, Du, Hongmin W.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.01.2023 Springer Nature B.V
Témata:	Algorithms Approximation Combinatorial analysis Combinatorics Complexity Constraints Convex and Discrete Geometry Design Integers Lower bounds Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Maximization Operations Research/Decision Theory Optimization Sensors Theory of Computation Streaming algorithm Integer lattice Knapsack constraints Noise
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!