arXiv Open Access 2009

Max Edge Coloring of Trees

Giorgio Lucarelli Ioannis Milis Vangelis Th. Paschos

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.DS

Penulis (3)

Giorgio Lucarelli

Ioannis Milis

Vangelis Th. Paschos

Format Sitasi

APA MLA BibTeX

Lucarelli, G., Milis, I., Paschos, V.T. (2009). Max Edge Coloring of Trees. https://arxiv.org/abs/0901.4002

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2009
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓