On the Maximum Edge Coloring Problem

Authors:
Giorgio Lucarelli;Ioannis Milis;Vangelis Th. Paschos
Affiliations:
Dept. of Informatics, Athens University of Economics and Business, Greece;Dept. of Informatics, Athens University of Economics and Business, Greece;LAMSADE, CNRS UMR 7024 and Université Paris-Dauphine, France
Venue:
Approximation and Online Algorithms
Year:
2009

Citing 8
Cited 1

Some results concerning the complexity of restricted colorings of graphs

Discrete Applied Mathematics
Restrictions and preassignments in preemptive open shop scheduling

Discrete Applied Mathematics
Weighted Node Coloring: When Stable Sets Are Expensive

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Buffer minimization using max-coloring

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
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
Weighted Coloring: further complexity and approximability results

Information Processing Letters
Approximation algorithms for the max-coloring problem

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Weighted coloring on planar, bipartite and split graphs: complexity and improved approximation

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

Span of t-colorings multigraphs

ICICA'12 Proceedings of the Third international conference on Information Computing and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the following generalization of the classical edge coloring problem: Given a weighted graph, find a partition of its edges into matchings (colors), each one of weight equal to the maximum weight of its edges, so that the total weight of the partition is minimized. We present new approximation algorithms for several variants of the problem with respect to the class of the underlying graph. In particular, we deal with variants which either 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 their complexity question still remains open (trees).