Approximating the max-edge-coloring problem

Authors:
N. Bourgeois;G. Lucarelli;I. Milis;V. Th. Paschos
Affiliations:
LAMSADE, CNRS and Université Paris-Dauphine, France;Department of Informatics, Athens University of Economics and Business, Greece;Department of Informatics, Athens University of Economics and Business, Greece;LAMSADE, CNRS and Université Paris-Dauphine, France
Venue:
Theoretical Computer Science
Year:
2010

Citing 14
Cited 4

Some results concerning the complexity of restricted colorings of graphs

Discrete Applied Mathematics
Restrictions and preassignments in preemptive open shop scheduling

Discrete Applied Mathematics
Buffer minimization using max-coloring

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Inclusion--Exclusion Algorithms for Counting Set Partitions

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Time slot scheduling of compatible jobs

Journal of Scheduling
Batch processing with interval graph compatibilities between tasks

Discrete Applied Mathematics
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Batch Coloring Flat Graphs and Thin

SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation

Discrete Applied Mathematics
Approximating the Max Edge-Coloring Problem

Combinatorial Algorithms
Weighted Coloring: further complexity and approximability results

Information Processing Letters
On the max coloring problem

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
On the max-weight edge coloring problem

Journal of Combinatorial Optimization
Approximation algorithms for the max-coloring problem

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Improved approximation algorithms for the max-edge coloring problem

TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Improved approximation algorithms for the Max Edge-Coloring problem

Information Processing Letters
On the max coloring problem

Theoretical Computer Science
An exponential time 2-approximation algorithm for bandwidth

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

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 the input graph minimizing the sum of all color classes' weights. We present new approximation results, that improve substantially the known ones, for several variants of the problem with respect to the class of the underlying graph. In particular, we deal with variants which are known to be NP-hard (general and bipartite graphs) or are proven to be NP-hard in this paper (complete graphs with bi-valued edge weights) or whose complexity question still remains open (trees).