The dominating set polytope via facility location

N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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 , there exists a facet defining inequality having coefficients in {1,...,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]. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Baïou, M., & Barahona, F. (2014). The dominating set polytope via facility location. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8596 LNCS, pp. 38–49). Springer Verlag. https://doi.org/10.1007/978-3-319-09174-7_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free