Online minimization knapsack problem

DOI10.1016/J.TCS.2015.09.021MaRDI QIDQ897874zbMATH OpenOpenAlexFDO

Authors Xin Han, Kazuhisa Makino

Publication date 8 December 2015

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2015.09.021

zbMATH Keywords

online algorithmscompetitive analysisknapsack

Mathematics Subject Classification ID

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

Recommendations

• Online minimization knapsack problem
• Randomized algorithms for removable online knapsack problems
• Online knapsack problem with removal cost
• Randomized algorithms for online knapsack problems
• Online removable knapsack with limited cuts

Cites work

• scientific article; zbMATH DE number 3705908 (Why is no real title available?)
• scientific article; zbMATH DE number 33203 (Why is no real title available?)
• scientific article; zbMATH DE number 3510069 (Why is no real title available?)
• scientific article; zbMATH DE number 2086630 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• scientific article; zbMATH DE number 910873 (Why is no real title available?)
• Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Finite-State Online Algorithms and Their Automated Competitive Analysis
• Incremental medians via online bidding
• Online knapsack revisited
• Online knapsack with resource augmentation
• Online minimization knapsack problem
• Online removable knapsack with limited cuts
• Online unweighted knapsack problem with removal cost
• Randomized algorithms for online knapsack problems
• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• Stochastic on-line knapsack problems

Cited in

(17)

• Online minimization knapsack problem
• Online Knapsack Problem Under Concave Functions
• Proportional cost buyback problem with weight bounds
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• Online Knapsack Problems with Limited Cuts
• Unit cost buyback problem
• Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem
• Online knapsack revisited
• Randomized algorithms for removable online knapsack problems
• Online knapsack problem under concave functions
• Online knapsack problem with removal cost
• Online knapsack of unknown capacity. How to optimize energy consumption in smartphones
• Optimal online \(k\)-min search
• Randomized algorithms for online knapsack problems
• Online removable knapsack with limited cuts
• Online knapsack revisited
• Online unweighted knapsack problem with removal cost

This page was built for publication: Online minimization knapsack problem

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