scientific article; zbMATH DE number 512917
From MaRDI portal
Publication:4281629
zbMath0791.68011MaRDI QIDQ4281629
Gerhard J. Woeginger, Hans L. Bodlaender, Klaus Jansen
Publication date: 7 April 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
schedulingmultiprocessor system\(NP\)-completepolynomial time approximation algorithmscoloring of precolored bipartite graphsjob incompatibilities
Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
Approximation results for the optimum cost chromatic partition problem ⋮ Approximation algorithms for time constrained scheduling
This page was built for publication:
