3 papers
cs.CC2009
Proceedings Fourth Athens Colloquium on Algorithms and Complexity
Evangelos Markakis, Ioannis Milis
ACAC 2009 is organized by the Athens University of Economics and Business (AUEB) and it is the fourth in a series of meetings that aim to bring together researchers working on all…
cs.DS2009
Bounded Max-Colorings of Graphs
Evripidis Bampis, Alexander Kononov, Giorgio Lucarelli +1
In a bounded max-coloring of a vertex/edge weighted graph, each color class is of cardinality at most and of weight equal to the weight of the heaviest vertex/edge in this clas…
cs.DS2009
Max Edge Coloring of Trees
Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos
We study the weighted generalization of the edge coloring problem where the weight of each color class (matching) equals to the weight of its heaviest edge and the goal is to minim…