Minimum Sum Multicoloring


The edge multicoloring problem is that given a graph G and integer demands x(e) for every edge e, assign a set of x(e) colors to vertex e, such that adjacent edges have disjoint sets of colors. In the minimum sum edge multicoloring problem the finish time of an edge is defined to be the highest color assigned to it. The goal is to minimize the sum of the… (More)


1 Figure or Table

Slides referencing similar topics