Approximating minimum cocolourings

DOI10.1007/3-540-44669-9_13MaRDI QIDQ4782702zbMATH OpenFDO

Authors Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli

Publication date 2 December 2002

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2138/21380118

zbMATH Keywords

polynomial-time algorithms

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Approximating minimum cocolorings.
• Approximation results for the minimum graph coloring problem
• On the approximation of Min Split-coloring and Min Cocoloring
• Approximation of min coloring by moderately exponential algorithms
• The complexity of minimum convex coloring
• The Complexity of Minimum Convex Coloring
• scientific article; zbMATH DE number 2085002
• Lower bounds for the minimal sum coloring problem
• Fixed-parameter algorithms for the cocoloring problem
• On approximability of minimum color-spanning ball in high dimensions

Cited in

(3)

• Approximating minimum cocolorings.
• On the approximation of Min Split-coloring and Min Cocoloring
• Approximation of min coloring by moderately exponential algorithms

This page was built for publication: Approximating minimum cocolourings

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