scientific article; zbMATH DE number 1163713

MaRDI QIDQ4395326zbMATH OpenFDO

Authors Klaus Jansen

Publication date 6 September 1998

zbMATH Keywords

approximationchromatic partitiongraphNP-completeness

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Approximation results for the optimum cost chromatic partition problem
• Approximation Results for the Optimum Cost Chromatic Partition Problem
• scientific article; zbMATH DE number 1947053

Cited in

(13)

• On a graph partition problem with application to VLSI layout
• On the approximability of an interval scheduling problem
• On sum coloring of graphs
• On the probabilistic minimum coloring and minimum k-coloring
• Chromatic kernel and its applications
• Edge-chromatic sum of trees and bounded cyclicity graphs
• Approximation results for the optimum cost chromatic partition problem
• The minimum color sum of bipartite graphs
• Approximation Results for the Optimum Cost Chromatic Partition Problem
• A heuristic for the minimum cost chromatic partition problem
• The probabilistic minimum coloring problem (extended abstract)
• The optimal cost chromatic partition problem for trees and interval graphs
• Time slot scheduling of compatible jobs

This page was built for publication:

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