The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints
type: Item
instance of: scholarly article
title: The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints
zbMATH Open document ID: 1393.68057
author: György Dósa
author: Leah Epstein
published in: Journal of Computer and System Sciences
publication date: 2018-06-06T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6881614
zbMATH Keywords: bin packing
zbMATH Keywords: first fit
zbMATH Keywords: asymptotic approximation ratio
MaRDI profile type: Publication
full work available at URL: j.jcss.2018.03.004
OpenAlex ID: W2796693314
cites work: Algorithms for on-line bin-packing problems with cardinality constraints
cites work: Q5111695
cites work: New lower bounds for certain classes of bin packing algorithms
cites work: Bounds for online bin packing with cardinality constraints
cites work: Approximation schemes for ordered vector packing problems
cites work: Q2957914
cites work: Online Bin Packing with Cardinality Constraints
cites work: Class constrained bin packing revisited
cites work: AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items
cites work: Improved lower bounds for the online bin packing problem with cardinality constraints
cites work: Resource constrained scheduling as generalized bin packing
cites work: Fast algorithms for bin packing
cites work: Cardinality constrained bin-packing problems
cites work: Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
cites work: A simple on-line bin-packing algorithm
cites work: A lower bound for on-line bin packing
cites work: On-line bin packing in linear time
cites work: On the online bin packing problem
cites work: Polynomial time approximation schemes for class-constrained packing problems
cites work: Tight bounds for online class-constrained packing
cites work: An improved lower bound for on-line bin packing algorithms
cites work: The class constrained bin packing problem with applications to video-on-demand
cites work: New Algorithms for Bin Packing
DOI: 10.1016/J.JCSS.2018.03.004
Wikidata QID: Q129980508
description: scientific article; zbMATH DE number 6881614