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 ∈ ℤ, 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+\frac{4q-2}{3q^2-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.
Supported by the National Grand Fundamental Research 973 Program of China under Grant No. 2002CB312004 and the National High-tech Research and Development 863 Program of China under Grant No. 2006AA01Z160.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brooks, R.L.: On colouring the nodes of a network. Proc. Cambridge Phil. Soc. 37, 194–197 (1941)
Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of computer computations, pp. 85–103. Plenum Press, New York (1972)
Garey, M.R., Johnson, D.S.: The complexity of near optimal graph coloring. J. ACM 23, 43–49 (1976)
Turner, J.S.: Almost all k-colorable graphs are easy to color. J. Algor. 9, 63–82 (1988)
Vizing, V.G.: On an estimate of the chromatic class of a p-graph (in Russian). Diskret. Analiz. 3, 25–30 (1964)
Holyer, I.J.: The NP-completeness of edge-coloring. SIAM J. Comp. 10, 718–720 (1981)
Feige, U., Ofek, E., Wieder, U.: Approximating maximum edge coloring in multigraphs. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 108–121. Springer, Heidelberg (2002)
Raniwala, A., Chiueh, T.-c.: Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network. In: INFOCOM, 2005, pp. 2223–2234 (2005)
Raniwala, A., Gopalan, K., Chiueh, T.-c.: Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks. Mobile Computing and Communications Review 8(2), 50–65 (2004)
Vazirani, V.V.: Approximation algorithms. Springer, Berlin (2001)
Micali, S., Vazirani, V.V.: An \(O(|V|^{\frac{1}{2}}|E|)\) algorithm for finding maximum matching in general graphs. In: Proc. 21st IEEE FOCS, pp. 17–27 (1980)
Gabow, H.N.: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In: Proc. 15th ACM STOC, pp. 448–456 (1983)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feng, W., Zhang, L., Qu, W., Wang, H. (2007). Approximation Algorithms for Maximum Edge Coloring Problem. In: Cai, JY., Cooper, S.B., Zhu, H. (eds) Theory and Applications of Models of Computation. TAMC 2007. Lecture Notes in Computer Science, vol 4484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72504-6_59
Download citation
DOI: https://doi.org/10.1007/978-3-540-72504-6_59
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72503-9
Online ISBN: 978-3-540-72504-6
eBook Packages: Computer ScienceComputer Science (R0)