On lazy bin covering and packing problems

DOI10.1016/j.tcs.2009.10.006zbMath1187.68714OpenAlexW2048451395MaRDI QIDQ1041247

Jinhui Xu, Yang Yang, Mingen Lin

Publication date: 1 December 2009

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

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

zbMATH Keywords

approximation algorithmslazy bin coveringmaximum resource bin packing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (4)

Open-end bin packing: new and old analysis approaches ⋮ A note on a variant of the online open end bin packing problem ⋮ Online lazy bureaucrat scheduling with a machine deadline ⋮ More on ordered open end bin packing

Cites Work

• Hardness of lazy packing and covering
• A 71/60 theorem for bin packing
• Bin packing can be solved within 1+epsilon in linear time
• Resource constrained scheduling as generalized bin packing
• Parameterized on-line open-end bin packing
• The maximum resource bin packing problem
• The Parametric Behavior of the First-Fit Decreasing Bin Packing Algorithm
• Analysis of a Compound Bin Packing Algorithm
• The Ordered Open-End Bin-Packing Problem
• A simple on-line bin-packing algorithm
• Improved Space for Bounded-Space, On-Line Bin-Packing
• Approximation and Online Algorithms
• Bounded space on-line bin packing: Best is better than first
• A note on an open-end bin packing problem

This page was built for publication: On lazy bin covering and packing problems