Flexible coloring

DOI10.1016/J.IPL.2011.03.004zbMath1259.05169OpenAlexW2913663170MaRDI QIDQ1944945

Ram Swaminathan, Atri Rudra, Xiao-Zhou Li

Publication date: 28 March 2013

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.03.004

zbMATH Keywords

graph coloringgraph algorithmsapproximation algorithmshardness of approximationflexible coloring

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• A still better performance guarantee for approximate graph coloring
• Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
• Approximation and Online Algorithms

This page was built for publication: Flexible coloring