Improved approximation algorithms for the Max Edge-Coloring problem

Authors:
Giorgio Lucarelli;Ioannis Milis
Affiliations:
LAMSADE, Université Paris-Dauphine, France;Department of Informatics, Athens University of Economics and Business, Greece
Venue:
Information Processing Letters
Year:
2011

Citing 10
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
Time slot scheduling of compatible jobs

Journal of Scheduling
Batch processing with interval graph compatibilities between tasks

Discrete Applied Mathematics
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation

Discrete Applied Mathematics
Max-Coloring Paths: Tight Bounds and Extensions

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Weighted Coloring: further complexity and approximability results

Information Processing Letters
Approximating the max-edge-coloring problem

Theoretical Computer Science
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

On the max coloring problem

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

The Max Edge-Coloring problem asks for a proper edge-coloring of an edge-weighted graph minimizing the sum of the weights of the heaviest edges in the color classes. In this paper we present a PTAS for trees and a 1.74-approximation algorithm for bipartite graphs; we also adapt the last algorithm to one for general graphs of the same, asymptotically, approximation ratio.