On lazy bin covering and packing problems
type: Item
instance of: scholarly article
title: On lazy bin covering and packing problems
zbMATH Open document ID: 1187.68714
author: Mingen Lin
author: Yang Yang
author: Jinhui Xu
published in: Theoretical Computer Science
publication date: 2009-12-01T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5641366
zbMATH Keywords: maximum resource bin packing
zbMATH Keywords: lazy bin covering
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.10.006
OpenAlex ID: W2048451395
cites work: The maximum resource bin packing problem
cites work: The Parametric Behavior of the First-Fit Decreasing Bin Packing Algorithm
cites work: Bounded space on-line bin packing: Best is better than first
cites work: Bin packing can be solved within 1+epsilon in linear time
cites work: Analysis of a Compound Bin Packing Algorithm
cites work: Hardness of lazy packing and covering
cites work: Resource constrained scheduling as generalized bin packing
cites work: A 71/60 theorem for bin packing
cites work: A simple on-line bin-packing algorithm
cites work: A note on an open-end bin packing problem
cites work: Approximation and Online Algorithms
cites work: Improved Space for Bounded-Space, On-Line Bin-Packing
cites work: The Ordered Open-End Bin-Packing Problem
cites work: Parameterized on-line open-end bin packing
DOI: 10.1016/J.TCS.2009.10.006
description: scientific article; zbMATH DE number 5641366