An approximation algorithm for circular arc colouring

DOI10.1007/s00453-001-0023-9zbMath0981.68123OpenAlexW2092288198MaRDI QIDQ5945920

No author found.

Publication date: 14 October 2001

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0023-9

zbMATH Keywords

colouringrandomized rounding

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) 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 (3)

Approximate constrained bipartite edge coloring ⋮ On the complexity of bandwidth allocation in radio networks ⋮ Perfect circular arc coloring

This page was built for publication: An approximation algorithm for circular arc colouring