d-Dimensional Knapsack in the Streaming Model

DOI10.1007/978-3-642-04128-0_42MaRDI QIDQ3639267zbMATH OpenOpenAlexFDO

Authors Sumit Ganguly, Christian Sohler

Publication date 29 October 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04128-0_42

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Improved 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 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

This page was built for publication: d-Dimensional Knapsack in the Streaming Model

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