An asymptotic competitive scheme for online bin packing

DOI10.1016/j.tcs.2015.04.038zbMath1332.68294OpenAlexW2136311412MaRDI QIDQ896124

Deshi Ye, Lin Chen, Guo-Chuan Zhang

Publication date: 11 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.04.038

zbMATH Keywords

online algorithmsbin packingcompetitive scheme

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
• Bin packing can be solved within 1+epsilon in linear time
• Lower bounds for on-line two-dimensional packing algorithms
• Fast algorithms for bin packing
• The maximum resource bin packing problem
• New Lower Bounds for Certain Classes of Bin Packing Algorithms
• On the online bin packing problem
• A simple on-line bin-packing algorithm
• New Algorithms for Bin Packing
• On-line bin packing in linear time
• Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming
• The optimal absolute ratio for online bin packing
• A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio

This page was built for publication: An asymptotic competitive scheme for online bin packing