Abstract
We study the following Constrained Bipartite Edge Coloring (CBEC) problem:We are given a bipartite graph G(U, V, E) of maximum degree l with n vertices, in which some of the edges have been legally colored with c colors. We wish to complete the coloring of the edges of G minimizing the total number of colors used. The problem has been proved to be NP-hard even for bipartite graphs of maximum degree three [5]. In previous work Caragiannis et al. [2] consider two special cases of the problem and proved tight bounds on the optimal number of colors by decomposing the bipartite graph into matchings which are colored into pairs using detailed potential and averaging arguments. Their techniques lead to 3/2-aproximation algorithms for both problems. In this paper we present a randomized (1.37 + o(1))-approximation algorithm for the general problem in the case where maxl, c = ω(ln n). Our techniques are motivated by recent work of Kumar [11] on the Circular Arc Coloring problem and are essentially different and simpler than those presented in [2].
This work was partially funded by the European Communities under IST FET Project ALCOM-FT and RTN Project ARACNE.
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
C. Berge. Graphs and Hypergraphs. North Holland, 1973.
I. Caragiannis, C. Kaklamanis, and P. Persiano. Edge Coloring of Bipartite Graphs with Constraints. In Proc. of the 24th International Symposium on Mathematical Foundations of Computer Science (MFCS 99), LNCS 1672, Springer, pp. 771–779, 1999.
R. Cole and J. Hopcroft. On Edge Coloring Bipartite Graphs. SIAM Journal on Computing, 11 (1982), pp. 540–546.
S. Even, A. Itai, and A. Shamir. On the Complexity of Timetable and Multicommodity Flow Problems. SIAM Journal on Computing, 5 (1976), pp. 691–703.
J. Fiala. NP-Completeness of the Edge Precoloring Extension Problem on Bipartite Graphs. Manuscript, 2000.
H.N. Gabow. Using Eulerian Partitions to Edge Color Bipartite Graphs. Internat. J. Comput. Inform. Sci., 5 (1976), pp. 345–355.
H.N. Gabow and O. Kariv. Algorithms for Edge Coloring Bipartite Graphs and Multigraphs. SIAM Journal on Computing, 11 (1982), pp. 117–129.
J. Hopcroft and R. Karp. An n 5/2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM Journal on Computing, 2 (1973), pp. 225–231.
C. Kaklamanis, P. Persiano, T. Erlebach, K. Jansen. Constrained Bipartite Edge Coloring with Applications to Wavelength Routing. In Proc. of the 24th International Colloquium on Automata, Languages, and Programming (ICALP’ 97), LNCS 1256, Springer Verlag, 1997, pp. 493–504.
D. König. Graphok és alkalmazásuk a determinások és a halmazok elméletére. Mathematikai és Természettudományi Értesitö, 34 (1916), pp. 104–119 (in Hungarian).
V. Kumar. Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks. In Proc. of the 1st International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX’ 98), LNCS, Springer, 1998. Journal version: An Approximation Algorithm for Circular Arc Coloring. Algorithmica, to appear.
M. Mihail, C. Kaklamanis, S. Rao. Efficient Access to Optical Bandwidth. In Proc. of the 36th Annual Symposium on Foundations of Computer Science (FOCS’ 95), 1995, pp. 548–557.
R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
P. Raghavan. Randomized Rounding and Discrete Ham-Sandwiches: Provably Good Algorithms for Routing and Packing Problems. PhD Thesis, UC Berkeley, 1986.
A. Schrijver. Bipartite Edge Coloring in O(δm) Time. SIAM Journal on Computing, 28(3) (1998), pp. 841–846.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caragiannis, I., Ferreira, A., Kaklamanis, C., Pérennes, S., Persiano, P., Rivano, H. (2001). Approximate Constrained Bipartite Edge Coloring. In: Brandstädt, A., Le, V.B. (eds) Graph-Theoretic Concepts in Computer Science. WG 2001. Lecture Notes in Computer Science, vol 2204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45477-2_4
Download citation
DOI: https://doi.org/10.1007/3-540-45477-2_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42707-0
Online ISBN: 978-3-540-45477-9
eBook Packages: Springer Book Archive