Bounded-space online bin cover
From MaRDI portal
Publication:1041340
DOI10.1007/S10951-009-0116-XzbMath1181.90282OpenAlexW2118750144MaRDI QIDQ1041340
Clifford Stein, Eyjólfur Ingi Ásgeirsson
Publication date: 2 December 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-009-0116-x
Related Items (2)
Bin covering with a general profit function: approximability results ⋮ Interior-Point-Based Online Stochastic Bin Packing
Cites Work
- Unnamed Item
- Unnamed Item
- Online algorithms for a dual version of bin packing
- Bin packing can be solved within 1+epsilon in linear time
- On the sum-of-squares algorithm for bin packing
- On a dual version of the one-dimensional bin packing problem
- Probabilistic analysis of algorithms for dual bin packing problems
- Stability of On-Line Bin Packing with Random Arrivals and Long-Run-Average Constraints
- Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings
- Markov chains, computer proofs, and average-case analysis of best fit bin packing
This page was built for publication: Bounded-space online bin cover
