Technical Report CS-2000-08

Title: Resource-Constrained Scheduling and Graph Multicoloring with Min-sum Objectives
Authors: Magnus M. Halldorsson, Guy Kortarz and Hadas Shachnai
Abstract: In the {\em sum multicoloring} problem we are given a graph and the number of colors required by each vertex. We need to find a multicoloring which minimizes the sum of the largest colors assigned to the vertices; it reduces to the known {\em sum coloring} problem when each vertex requires exactly one color. The sum multicoloring problem has many applications, in scheduling, resource allocation, copiler design and VLSI routing. We survey the results published on the sum multicoloring problem, and describe some recent developments. We then discuss several interesting avenues for future study.
CopyrightThe above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information

Remark: Any link to this technical report should be to this page (, rather than to the URL of the PDF files directly. The latter URLs may change without notice.

To the list of the CS technical reports of 2000
To the main CS technical reports page

Computer science department, Technion