Abstract
In this paper we present an extended formulation for the dominating set polytope via facility location. We show that with this formulation we can describe the dominating set polytope for cacti graphs, though its description in the natural node variables dimension has been only partially obtained. Moreover, the inequalities describing this polytope have coefficients in \(\{-1,0,1\}\). This is not the case for the dominating set polytope in the node-variables dimension. It is known from [1] that for any integer \(p\), there exists a facet defining inequality having coefficients in \(\{1,\ldots ,p\}\). We also show a decomposition theorem by means of 1-sums. Again this decomposition is much simpler with the extended formulation than with the node-variables formulation given in [2].
This work has been supported by project PICS05891, CNRS-IBM.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bouchakour, M., Contenza, T.M., Lee, C.W., Mahjoub, A.R.: On the dominating set polytope. Eur. J. Comb. 29(3), 652–661 (2008)
Bouchakour, M., Mahjoub, A.R.: One-node cutsets and the dominating set polytope. Discrete Math. 165–166(15), 101–123 (1997)
Haynes, T., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. Monographs and Textbooks in Pure and Applied Mathematics. Taylor & Francis, Boca Raton (1998)
Haynes, T., Hedetniemi, S., Slater, P.: Domination in Graphs: Advanced Topics. Monographs and Textbooks in Pure and Applied Mathematics, vol. 2. Taylor & Francis, Boca Raton (1998)
Mahjoub, A.R.: Polytope des absorbants dans une classe de graphe a seuil. North-Holland Math. Stud. 75, 443–452 (1983)
Bouchakour, M.: I: Composition de graphes et le polytope des absorbants, II: Un algorithme de coupes pour le problème du flot à coût fixes. Ph.D. thesis, Université de Rennes 1, Rennes, France, December 1996
Farber, M.: Domination, independent domination, and duality in strongly chordal graphs. Discrete Appl. Math. 7(2), 115–130 (1984)
Saxena, A.: Some results on the dominating set polytope of a cycle. GSIA Working paper 2004-E28 (2004)
Cornuéjols, G., Sassano, A.: On the 0, 1 facets of the set covering polytope. Math. Program. 43, 45–55 (1989)
Balas, E., Ng, S.M.: On the set covering polytope: I. All the facets with coefficients in 0, 1, 2. Math. Program. 43, 57–69 (1989)
Balas, E., Ng, S.M.: On the set covering polytope: II. Lifting the facets with coefficients in 0, 1, 2. Math. Program. 45, 1–20 (1989)
Cornuéjols, G., Novick, B.: Ideal 0, 1 matrices. J. Comb. Theory Ser. B 60(1), 145–157 (1994)
Sánchez-García, M., Sobrón, M., Vitoriano, B.: On the set covering polytope: facets with coefficients in \(\{0, 1, 2, 3\}\). Ann. Oper. Res. 81, 343–356 (1998)
Bianchi, S., Nasini, G., Tolomei, P.: The minor inequalities in the description of the set covering polyhedron of circulant matrices. Preprint (2012)
Avella, P., Sassano, A., Vasilév, I.: Computational study of large-scale p-median problems. Math. Program. 109, 89–114 (2007)
Padberg, M.W.: On the facial structure of set packing polyhedra. Math. Program. 5, 199–215 (1973)
Cornuejols, G., Thizy, J.M.: Some facets of the simple plant location polytope. Math. Program. 23(1), 50–74 (1982)
Cho, D.C., Johnson, E.L., Padberg, M., Rao, M.R.: On the uncapacitated plant location problem. I. Valid inequalities and facets. Math. Oper. Res. 8(4), 579–589 (1983)
Cho, D.C., Padberg, M.W., Rao, M.R.: On the uncapacitated plant location problem. II. Facets and lifting theorems. Math. Oper. Res. 8(4), 590–612 (1983)
Baïou, M., Barahona, F.: Simple extended formulation for the dominating set polytope via facility location. IBM Research Report RC25325t (2012)
Eisenbrand, F., Oriolo, G., Stauffer, G., Ventura, P.: The stable set polytope of quasi-line graphs. Combinatorica 28(1), 45–67 (2008)
Baïou, M., Barahona, F.: On the integrality of some facility location polytopes. SIAM J. Discrete Math. 23(2), 665–679 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Baïou, M., Barahona, F. (2014). The Dominating Set Polytope via Facility Location. In: Fouilhoux, P., Gouveia, L., Mahjoub, A., Paschos, V. (eds) Combinatorial Optimization. ISCO 2014. Lecture Notes in Computer Science(), vol 8596. Springer, Cham. https://doi.org/10.1007/978-3-319-09174-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-09174-7_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09173-0
Online ISBN: 978-3-319-09174-7
eBook Packages: Computer ScienceComputer Science (R0)