论文信息 - Max Edge Coloring of Trees

Max Edge Coloring of Trees

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 minimize the sum of the colors' weights. We present a 3/2-approximation algorithm for trees.

Vangelis Th. Paschos | Ioannis Milis | Giorgio Lucarelli

[1] Vangelis Th. Paschos,et al. Weighted Coloring: Further Complexity and Approximability Results , 2005, ICTCS.

[2] V. Paschos,et al. On a generalized graph coloring/batch scheduling problem , 2007 .

[3] Rajiv Raman,et al. Buffer minimization using max-coloring , 2004, SODA '04.

[4] Vangelis Th. Paschos,et al. Weighted Node Coloring: When Stable Sets Are Expensive , 2002, WG.

[5] Vangelis Th. Paschos,et al. On the Maximum Edge Coloring Problem , 2009, WAOA.

[6] Kirill Kogan,et al. Nonpreemptive Scheduling of Optical Switches , 2007, IEEE Transactions on Communications.

[7] Rajiv Raman,et al. Approximation Algorithms for the Max-coloring Problem , 2005, ICALP.

[8] Vangelis Th. Paschos,et al. Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation , 2004, ISAAC.