Streaming algorithms for maximizing DR-submodular functions with \(d\)-knapsack constraints

DOI10.1007/978-3-030-93176-6_14zbMath1498.90194OpenAlexW4205195062MaRDI QIDQ2151370

Bin Liu, Hongmin W. Du, Zihan Chen

Publication date: 1 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-93176-6_14

zbMATH Keywords

integer latticestreaming algorithm\(d\)-knapsack constraintsDR-submodular maximization

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Maximizing monotone submodular functions over the integer lattice
• Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
• Online Submodular Maximization with Preemption
• Online submodular welfare maximization: Greedy is optimal
• Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint

This page was built for publication: Streaming algorithms for maximizing DR-submodular functions with \(d\)-knapsack constraints