Approximation algorithms for maximum edge coloring problem

Authors:
Wangsen Feng;Li'ang Zhang;Wanling Qu;Hanpin Wang
Affiliations:
School of Electronic Engineering and Computer Science, Peking University, Beijing, P.R. China;School of Electronic Engineering and Computer Science, Peking University, Beijing, P.R. China;School of Electronic Engineering and Computer Science, Peking University, Beijing, P.R. China;School of Electronic Engineering and Computer Science, Peking University, Beijing, P.R. China
Venue:
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Year:
2007

Citing 7
Cited 0

Almost all k-colorable graphs are easy to color

Journal of Algorithms
The Complexity of Near-Optimal Graph Coloring

Journal of the ACM (JACM)
Approximation algorithms

Approximation algorithms
Approximating Maximum Edge Coloring in Multigraphs

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks

ACM SIGMOBILE Mobile Computing and Communications Review
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose polynomial time approximation algorithms for a novel maximum edge coloring problem which arises from the field of wireless mesh networks [8]. The problem is about coloring all the edges in a graph and finding a coloring solution which uses the maximum number of colors with the constraint, for every vertex in the graph, all the edges incident to it are colored with no more than q(q ∈ Z, q ≥ 2) colors. The case q = 2 is of great importance in practice. In this paper, we design approximation algorithms for cases q = 2 and q 2 with approximation ratio 2.5 and 1 + 4q-2/3q2-5q+2 respectively. The algorithms can give practically usable estimations on the upper bounds of the numbers of the channels used in wireless mesh networks.