Online interval coloring with packing constraints
type: Item
instance of: scholarly article
title: Online interval coloring with packing constraints
zbMATH Open document ID: 1153.68055
author: Leah Epstein
author: Meital Levy
published in: Theoretical Computer Science
publication date: 2008-11-18T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5368328
zbMATH Keywords: interval coloring
zbMATH Keywords: bin packing
zbMATH Keywords: online algorithms
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.05.018
OpenAlex ID: W2079991317
cites work: Approximation and Online Algorithms
cites work: An improved algorithm for online coloring of intervals with bandwidth
cites work: Algorithms for on-line bin-packing problems with cardinality constraints
cites work: Approximation schemes for ordered vector packing problems
cites work: On some packing problem related to dynamic storage allocation
cites work: Online Bin Packing with Cardinality Constraints
cites work: Automata, Languages and Programming
cites work: Q4291430
cites work: Resource constrained scheduling as generalized bin packing
cites work: 25 pretty graph colouring problems
cites work: The Linearity of First-Fit Coloring of Interval Graphs
cites work: Coloring interval graphs with First-Fit
cites work: Q3950561
cites work: Multidimensional Bin Packing Algorithms
cites work: Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
cites work: Q5501309
cites work: Q3815303
cites work: The Ordered Open-End Bin-Packing Problem
DOI: 10.1016/J.TCS.2008.05.018
description: scientific article; zbMATH DE number 5368328