Streaming submodular maximization under d-knapsack constraints

DOI10.1007/S10878-022-00951-1MaRDI QIDQ2682804zbMATH OpenOpenAlexFDO

Authors Zihan Chen, Bin Liu, Hongmin W. Du

Publication date 1 February 2023

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-022-00951-1

zbMATH Keywords

\(d\)-knapsack constraintsinteger latticenoisestreaming algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
• Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
• Streaming algorithms for maximizing DR-submodular functions with d-knapsack constraints
• Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
• Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
• Streaming algorithms for submodular function maximization
• An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint
• Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint
• A survey on streaming algorithms for maximizing submodular functions
• Streaming submodular maximization with the chance constraint

Cites work

• A note on maximizing a submodular set function subject to a knapsack constraint
• An analysis of approximations for maximizing submodular set functions—I
• Best Algorithms for Approximating the Maximum of a Submodular Set Function
• Discrete convex analysis
• scientific article; zbMATH DE number 6474901 (Why is no real title available?)
• Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
• Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
• Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
• Maximizing submodular set functions subject to multiple linear constraints
• Online submodular maximization with preemption
• Online submodular welfare maximization: greedy is optimal
• Submodular functions and optimization.

Cited in

(14)

• Streaming submodular maximization under differential privacy noise
• Streaming algorithms for maximizing DR-submodular functions with d-knapsack constraints
• Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms
• Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
• Submodular maximization over data streams with differential privacy noise
• On streaming algorithms for maximizing a supermodular function plus a MDR-submodular function on the integer lattice
• Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
• Streaming algorithms for maximizing monotone DR-submodular functions with a cardinality constraint on the integer lattice
• Thresholding Methods for Streaming Submodular Maximization with a Cardinality Constraint and Its Variants
• Submodular Maximization Subject to a Knapsack Constraint Under Noise Models
• Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
• Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
• Streaming submodular maximization with the chance constraint
• Streaming algorithms for non-submodular functions maximization with \(d\)-knapsack constraint on the Integer lattice

This page was built for publication: Streaming submodular maximization under \(d\)-knapsack constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2682804)