Multicoloring trees.
type: Item
instance of: scholarly article
title: Multicoloring trees.
zbMATH Open document ID: 1054.68016
DOI: 10.1016/S0890-5401(02)00032-9
author: Magnús M. Halldórsson
author: Guy Kortsarz
author: Andrzej Proskurowski
author: Ravit Salman
author: Hadas Shachnai
author: Jan Arne Telle
published in: Information and Computation
publication date: 2003-08-19T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1967116
zbMATH Keywords: Multicoloring
zbMATH Keywords: Approximation algorithms
zbMATH Keywords: Resource allocation
zbMATH Keywords: Scheduling
MaRDI profile type: Publication
cites work: On chromatic sums and distributed resource allocation
cites work: Sum Multicoloring of Graphs
cites work: Minimum Color Sum of Bipartite Graphs
cites work: Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
cites work: Zero knowledge and the chromatic number
cites work: Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees
cites work: Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors
cites work: The chromatic sum of a graph: history and recent developments
cites work: Upper bounds for static resource allocation in a distributed system
cites work: Q4708601
cites work: Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is $\cal NP$-Complete
cites work: Q4344125
full work available at URL: s0890-5401(02)00032-9
OpenAlex ID: W2913829344
description: scientific article; zbMATH DE number 1967116