A matched approximation bound for the sum of a greedy coloring

DOI10.1016/S0020-0190(99)00104-0zbMath0995.05054OpenAlexW1973571353MaRDI QIDQ1606980

Magnús M. Halldórsson, Amotz Bar-Noy, Guy Kortsarz

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00104-0

zbMATH Keywords

minimum sum coloring problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

Preemptive and non-preemptive generalized min sum set cover

This page was built for publication: A matched approximation bound for the sum of a greedy coloring