Online minimization knapsack problem

DOI10.1016/j.tcs.2015.09.021zbMath1331.68299OpenAlexW2174718091MaRDI QIDQ897874

Kazuhisa Makino, Xin Han

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

competitive analysisonline algorithmsknapsack

Mathematics Subject Classification ID

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

Related Items (8)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Online knapsack of unknown capacity. How to optimize energy consumption in smartphones ⋮ Proportional cost buyback problem with weight bounds ⋮ Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem ⋮ Online Knapsack Problem Under Concave Functions ⋮ Relaxing the irrevocability requirement for online graph algorithms ⋮ Online knapsack problem under concave functions ⋮ Unit cost buyback problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Online knapsack revisited
• Online removable knapsack with limited cuts
• Randomized algorithms for online knapsack problems
• Online unweighted knapsack problem with removal cost
• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• Online knapsack with resource augmentation
• Stochastic on-line knapsack problems
• Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
• Incremental medians via online bidding
• Online Minimization Knapsack Problem
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Finite-State Online Algorithms and Their Automated Competitive Analysis

This page was built for publication: Online minimization knapsack problem