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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of combinatorial optimization Vol. 45; no. 1; p. 15
Main Authors:	Chen, Zihan, Liu, Bin, Du, Hongmin W.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.01.2023 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!