Progress (and Lack Thereof) for Graph Coloring Approximation Problems

DOI10.1007/978-3-662-46078-8_2zbMATH Open1432.68356OpenAlexW3100669MaRDI QIDQ5175094

Magnús M. Halldórsson

Publication date: 20 February 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46078-8_2

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 (4)

Improving the performance guarantee for approximate graph coloring ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness

This page was built for publication: Progress (and Lack Thereof) for Graph Coloring Approximation Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5175094)