Tight bounds for online class-constrained packing
type: Item
instance of: scholarly article
title: Tight bounds for online class-constrained packing
zbMATH Open document ID: 1067.90144
author: Hadas Shachnai
author: Tami Tamir
published in: Theoretical Computer Science
publication date: 2004-08-10T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05B40
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 2085538
zbMATH Keywords: Class-constraints
zbMATH Keywords: Bin packing
zbMATH Keywords: Multiple knapsack
zbMATH Keywords: Temporary assignment
zbMATH Keywords: Online algorithms
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.tcs.2003.05.006
OpenAlex ID: W2171709162
cites work: Q4828923
cites work: Fair versus unrestricted bin packing
cites work: On-line load balancing
cites work: On-Line Load Balancing of Temporary Tasks on Identical Machines
cites work: Q4474134
cites work: Q4223058
cites work: The accommodating function: A generalization of the competitive ratio
cites work: Approximation algorithms for knapsack problems with cardinality constraints
cites work: Online algorithms. The state of the art
cites work: Q4133108
cites work: Design and implementation of scalable continuous media servers
cites work: Q4952620
cites work: Fast algorithms for bin packing
cites work: Cardinality constrained bin-packing problems
cites work: Q4796167
cites work: Q3751378
cites work: Polynomial time approximation schemes for class-constrained packing problems
cites work: On two class-constrained versions of the multiple knapsack problem
cites work: Multiprocessor scheduling with machine allotment and parallelism constraints
cites work: On the Asymptotic Worst Case Behavior of Harmonic Fit
cites work: New Algorithms for Bin Packing
DOI: 10.1016/J.TCS.2003.05.006
description: scientific article; zbMATH DE number 2085538