Batch coloring of graphs
type: Item
instance of: scholarly article
title: Batch coloring of graphs
zbMATH Open document ID: 1414.05109
author: Leah Epstein
author: Kim S. Larsen
author: Asaf Levin
author: Joan Boyar
author: Lene M. Favrholdt
published in: Algorithmica
publication date: 2019-01-11T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 7000144
zbMATH Keywords: online algorithms
zbMATH Keywords: graph coloring
zbMATH Keywords: batches
zbMATH Keywords: interval graphs
zbMATH Keywords: sum coloring
MaRDI profile type: Publication
full work available at URL: s00453-017-0386-1
OpenAlex ID: W2766932952
cites work: Tight Bounds for Online Coloring of Basic Graph Classes
cites work: Lower bound for 3-batched bin packing
cites work: Improved lower bounds for semi-online bin packing problems
cites work: On chromatic sums and distributed resource allocation
cites work: Precoloring extension. I: Interval graphs
cites work: On sum coloring and sum multi-coloring for restricted families of graphs
cites work: Batched bin packing revisited
cites work: More on batched bin packing
cites work: Q3328583
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Batched bin packing
cites work: On-line and first fit colorings of graphs
cites work: Q3496352
cites work: Online coloring known graphs
cites work: Lower bounds for on-line graph coloring
cites work: First-fit coloring on interval graphs has performance ratio at least 5
cites work: Q3950561
cites work: The chromatic sum of a graph: history and recent developments
cites work: A note on first-fit coloring of interval graphs
cites work: On the sum coloring problem on interval graphs
cites work: Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is $\cal NP$-Complete
DOI: 10.1007/S00453-017-0386-1
description: scientific article; zbMATH DE number 7000144