Approximating the max-edge-coloring problem

The max-edge-coloring problem is a natural weighted generalization of the classical edge-coloring problem arising in the domain of communication systems. In this problem each color class is assigned the weight of the heaviest edge in this class and the objective is to find a proper edge-coloring of...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theoretical computer science 2010-07, Vol.411 (34), p.3055-3067
Hauptverfasser:	Bourgeois, N., Lucarelli, G., Milis, I., Paschos, V.Th
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Approximation Approximation algorithms C (programming language) Color Combinatorics Combinatorics. Ordered structures Communication systems Complexity Computer science control theory systems Exact sciences and technology Graph theory Graphs Information retrieval. Graph Mathematical analysis Mathematics Max-edge-coloring Miscellaneous Sciences and techniques of general use Theoretical computing Trees
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!