Abstract
We study the following optimization problem: the input is a multigraph G=(V,E) and an integer parameter g. A feasible solution consists of a (not necessarily proper) coloring of E with colors 1, 2, ..., g. Denote by d(v,i) the number of edges colored i incident to v. The objective is to minimize \(\sum_{v \in{V}} \mbox{max}_{i}d(v,i)\), which roughly corresponds to the “imbalance” of the edge coloring. This problem was proposed by Berry and Modiano (INFOCOM 2004), with the goal of optimizing the deployment of tunable ports in optical networks. Following them we call the optimization problem MTPS – Minimum Tunable Port with Symmetric Assignments.
Among other results, they give a reduction from Edge Coloring showing that MTPS is NP-Hard and then give a 2-approximation algorithm. We give a (3/2)-approximation algorithm. Key to this problem is the following question: given a multigraph G=(V,E) of maximum degree g, what fraction of the vertices can be properly edge-colored in a coloring with g colors, where a vertex is properly edge-colored if the edges incident to it have different colors? Our main lemma states that there is such a coloring with half of the vertices properly edge-colored. For g ≤4, two thirds of vertices can be made properly edge-colored.
Our algorithm is based on g Maximum Matching computations (total running time \(O(g m \sqrt{n + m/g})\)) and a local optimization procedure, which by itself gives a 2-approximation. An interesting analysis gives an expected O((gn + m) log(gn +m)) running time for the local optimization procedure.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and hardness of approximation problems. Journal of ACM 45(3), 501–555 (1998)
Berry, R.A., Modiano, E.: On the benefit of tunability in reducing electronic port counts in WDM/TDM networks. In: INFOCOM, vol. 2, pp. 1340–1351 (2004)
Berry, R.A., Modiano, E.: Optimal transceiver scheduling in WDM/TDM networks. IEEE Journal on Selected Areas in Communications 23(8), 1471–1495 (2005)
Edmonds, J.: Paths, trees, and flowers. Canadian J. Math. 17, 449–467 (1965)
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)
Hilton, A.J.W., de Werra, D.: A sufficient condition for equitable edge-colourings of simple graphs. Discrete Mathematics 128, 179–201 (1994)
Holyer, I.: The NP-completeness of edge-coloring. SIAM J. Comput. 10(4), 718–720 (1981)
Lovász, L., Plummer, M.D.: Matching Theory. Elsevier Science, Amsterdam (1986)
Micali, S., Vazirani, V.V.: An \({O}(\sqrt{|V|} |e|)\) algorithm for finding maximum matching in general graphs. In: FOCS, pp. 17–27 (1980)
Shannon, C.E.: A theorem on coloring the lines of a network. J. Math. Phys. 28, 148–151 (1949)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Calinescu, G., Pelsmajer, M.J. (2006). Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance. In: Arun-Kumar, S., Garg, N. (eds) FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2006. Lecture Notes in Computer Science, vol 4337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11944836_13
Download citation
DOI: https://doi.org/10.1007/11944836_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49994-7
Online ISBN: 978-3-540-49995-4
eBook Packages: Computer ScienceComputer Science (R0)