Sum Multicoloring of Graphs

@article{BarNoy2000SumMO,
  title={Sum Multicoloring of Graphs},
  author={Amotz Bar-Noy and Magn{\'u}s M. Halld{\'o}rsson and Guy Kortsarz and Ravit Salman and Hadas Shachnai},
  journal={J. Algorithms},
  year={2000},
  volume={37},
  pages={422-450}
}
Scheduling dependent jobs on multiple machines is modeled by the graph multicoloring problem. In this paper we consider the problem of minimizing the average completion time of all jobs. This is formalized as the sum multicoloring problem: Given a graph and the number of colors required by each vertex, nd a multicoloring which minimizes the sum of the largest colors assigned to the vertices. It reduces to the known sum coloring problem when each vertex requires exactly one color. This paper… CONTINUE READING
Highly Cited
This paper has 74 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 38 citations

74 Citations

0510'97'02'08'14
Citations per Year
Semantic Scholar estimates that this publication has 74 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 23 references

Multicoloring Planar Graphs and Partialktrees

  • A. Proskurowski, R. Salman, H. Shachnai, J. A. Telle.
  • 1999

Sum MultiColoring of Graphs

  • M. M. Halldórsson
  • 1999

Kortsarz . The minimum colorsum of bipartite graphs

  • I. Cidon
  • Journal of Algorithms
  • 1998