Abstract
Let H be a fixed graph without loops. We prove that if H is a co-circular arc bigraph then the minimum cost homomorphism problem to H admits a polynomial time constant ratio approximation algorithm; otherwise the minimum cost homomorphism problem to H is known to be not approximable. This solves a problem posed in an earlier paper. For the purposes of the approximation, we provide a new characterization of co-circular arc bigraphs by the existence of min ordering. Our algorithm is then obtained by derandomizing a two-phase randomized procedure. We show a similar result for graphs H in which all vertices have loops: if H is an interval graph, then the minimum cost homomorphism problem to H admits a polynomial time constant ratio approximation algorithm, and otherwise the minimum cost homomorphism problem to H is not approximable.
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
Aggarwal, G., Feder, T., Motwani, R., Zhu, A.: Channel assignment in wireless networks and classiffcation of minimum graph homomorphisms. Electronic Colloq. on Comput. Complexity (ECCC) TR06-040 (2006)
Feder, T., Hell, P.: List Homomorphism to reflexive graphs. J. Combin. Theory B 72, 236–250 (1998)
Feder, T., Hell, P., Huang, J.: List homomorphisms and circular arc graphs. Combinatorica 19, 487–505 (1999)
Feder, T., Hell, P., Huang, J.: Bi-arc graphs and the complexity of list homomorphisms. J. Graph Th. 42, 61–80 (2003)
Feder, T., Hell, P., Huang, J., Rafiey, A.: Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms. Discrete Appl. Math. 160(6), 697–707 (2012)
Feder, T., Hell, P., Jonsson, P., Krokhin, A., Nordh, G.: Retractions to pseudo-forests. SIAM J. on Discrete Math. 24, 101–112 (2010)
Gupta, A., Hell, P., Karimi, M., Rafiey, A.: Minimum Cost Homomorphisms to Reflexive Digraphs. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 182–193. Springer, Heidelberg (2008)
Gutin, G., Rafiey, A., Yeo, A., Tso, M.: Level of repair analysis and minimum cost homomorphisms of graphs. Discrete Appl. Math. 154, 881–889 (2006)
Gutin, G., Hell, P., Rafiey, A., Yeo, A.: A dichotomy for minimum cost graph homomorphisms. European J. Combin. 29, 900–911 (2008)
Halldórsson, M.M., Kortsarz, G., Shachnai, H.: Minimizing Average Completion of Dedicated Tasks and Interval Graphs. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol. 2129, pp. 114–126. Springer, Heidelberg (2001)
Hell, P., Huang, J.: Interval bigraphs and circular arc graphs. J. Graph Theory 46, 313–327 (2004)
Hell, P., Nešetřil, J.: Graphs and homomorphisms. Oxford University Press (2004)
Hell, P., Rafiey, A.: The dichotomy of list homomorphisms for digraphs. In: SODA 2011 (2011)
Hell, P., Rafiey, A.: Duality for min-max orderings and dichotomy for minimum cost homomorphisms, arXiv:0907.3016v1 [cs.DM]
Jansen, K.: Approximation results for the optimum cost chromatic partition problem. J. Algorithms 34, 54–89 (2000)
Jiang, T., West, D.B.: Coloring of trees with minimum sum of colors. J. Graph Theory 32, 354–358 (1999)
Kroon, L.G., Sen, A., Deng, H., Roy, A.: The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs. In: D’Amore, F., Marchetti-Spaccamela, A., Franciosa, P.G. (eds.) WG 1996. LNCS, vol. 1197, pp. 279–292. Springer, Heidelberg (1997)
Larose, B., Lemaitre, A.: List-homomorphism problems on graphs and arc consistency (2012) (manuscript)
McConnell, R.M.: Linear-time recognition of circular-arc graphs. Algorithmica 37, 93–147 (2003)
Mastrolilli, M., Rafiey, A.: On the approximation of minimum cost homomorphism to bipartite graphs. Discrete Applied Mathematics (June 22, 2011) (in press), http://dx.doi.org/10.1016/j.dam.2011.05.002
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hell, P., Mastrolilli, M., Nevisi, M.M., Rafiey, A. (2012). Approximation of Minimum Cost Homomorphisms. In: Epstein, L., Ferragina, P. (eds) Algorithms – ESA 2012. ESA 2012. Lecture Notes in Computer Science, vol 7501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33090-2_51
Download citation
DOI: https://doi.org/10.1007/978-3-642-33090-2_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33089-6
Online ISBN: 978-3-642-33090-2
eBook Packages: Computer ScienceComputer Science (R0)