Approximate hypergraph coloring

DOI10.1007/3-540-61422-2_119zbMath0886.05091OpenAlexW2177143319MaRDI QIDQ4375639

H. Ramesh, Pierre Kelsen, Sanjeev Mahajan

Publication date: 4 May 1998

Published in: Algorithm Theory — SWAT'96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61422-2_119

zbMATH Keywords

hypergraphsemidefinite programmingcoloringapproximation algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Hardness of Rainbow Coloring Hypergraphs

This page was built for publication: Approximate hypergraph coloring