Max Edge Coloring of Trees
Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos
TL;DR
This paper introduces a 3/2-approximation algorithm for the weighted edge coloring problem in trees, where the goal is to minimize the sum of maximum edge weights in each color class.
Contribution
The paper presents the first approximation algorithm with a 3/2 ratio for the weighted edge coloring problem on trees.
Findings
Achieved a 3/2-approximation ratio for the problem
Provides an efficient algorithm for weighted edge coloring in trees
Advances understanding of coloring problems in tree structures
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScheduling and Timetabling Solutions · Advanced Graph Theory Research · Graph Labeling and Dimension Problems