Sum Multicoloring of Graphs

DOI10.1006/jagm.2000.1106zbMath0964.68105OpenAlexW2012491806MaRDI QIDQ4521523

Ravit Salman, Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai

Publication date: 19 December 2000

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/261cc0d6c1d6291c55f3bb8ece9bca10378cf0a0

zbMATH Keywords

schedulinggraph multicoloring problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (9)

Scheduling with conflicts: Online and offline algorithms ⋮ Multicoloring trees. ⋮ Minimum sum set coloring of trees and line graphs of trees ⋮ Batch Coloring Flat Graphs and Thin ⋮ Non-clairvoyant scheduling with conflicts for unit-size jobs ⋮ Dynamic programming based algorithms for set multicover and multiset multicover problems ⋮ Minimum sum multicoloring on the edges of trees ⋮ On sum coloring and sum multi-coloring for restricted families of graphs ⋮ Weighted sum coloring in batch scheduling of conflicting jobs

This page was built for publication: Sum Multicoloring of Graphs