The maximum resource bin packing problem

DOI10.1016/j.tcs.2006.06.001zbMath1100.68125MaRDI QIDQ2508970

Kim S. Larsen, Morten M. Pedersen, Sanne Wøhlk, Jens S. Kohrt, Leah Epstein, Joan. Boyar, Lene Monrad Favrholdt

Publication date: 20 October 2006

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

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

zbMATH Keywords

approximation; bin packing; dual bin packing; on-line

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W05: Nonnumerical algorithms

90C27: Combinatorial optimization

68W25: Approximation algorithms

Related Items

An asymptotic competitive scheme for online bin packing, Competitive analysis of the online inventory problem, Hardness of lazy packing and covering, On lazy bin covering and packing problems, An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem, Online lazy bureaucrat scheduling with a machine deadline, Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An approximation algorithm for the maximum traveling salesman problem
• On approximating the longest path in a graph
• Competitive snoopy caching
• The lazy bureaucrat scheduling problem
• An asymptotic fully polynomial time approximation scheme for bin covering.
• On a dual version of the one-dimensional bin packing problem
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• Bounds for Certain Multiprocessing Anomalies
• Automata, Languages and Programming