• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

On the independent dominating set polytope

Mahjoub, Ali Ridha; Mailfert, Jean (2006), On the independent dominating set polytope, European Journal of Combinatorics, 27, 4, p. 601-616. http://dx.doi.org/10.1016/j.ejc.2004.07.015

Type
Article accepté pour publication ou publié
Date
2006
Journal name
European Journal of Combinatorics
Volume
27
Number
4
Publisher
Elsevier
Pages
601-616
Publication identifier
http://dx.doi.org/10.1016/j.ejc.2004.07.015
Metadata
Show full item record
Author(s)
Mahjoub, Ali Ridha
Mailfert, Jean
Abstract (EN)
In this paper, we consider the independent dominating set polytope. We give a complete linear description of that polytope when the graph is reduced to a cycle. This description uses a general class of valid inequalities introduced in [T.M. Contenza, Some results on the dominating set polytope, Ph.D. Dissertation, University of Kentucky, 2000]. We devise a polynomial time separation algorithm for these inequalities. As a consequence, we obtain a polynomial time cutting plane algorithm for the minimum (maximum) independent dominating set problem on a cycle. We also introduce a lifting operation called twin operation, and discuss some polyhedral consequences. In particular, we show that the above results can be extended to a more general class of graphs.
Subjects / Keywords
Polynomial time separation algorithm; Graph; Polytope

Related items

Showing items related by title and author.

  • Thumbnail
    On the dominating set polytope 
    Bouchakour, Mustapha; Contenza, Teresa; Lee, C.W; Mahjoub, Ali Ridha (2008) Article accepté pour publication ou publié
  • Thumbnail
    One-node cutsets and the dominating set polytope 
    Bouchakour, Mustapha; Mahjoub, Ali Ridha (1997) Article accepté pour publication ou publié
  • Thumbnail
    Compositions of Graphs and the Triangle-Free Subgraph Polytope 
    Bendali, Fatiha; Mailfert, Jean; Mahjoub, Ali Ridha (2002) Article accepté pour publication ou publié
  • Thumbnail
    The k edge-disjoint 3-hop-constrained paths polytope 
    Bendali, Fatiha; Mahjoub, Ali Ridha; Mailfert, Jean; Diarrassouba, Ibrahima (2010) Article accepté pour publication ou publié
  • Thumbnail
    A Branch-and-Cut algorithm for the k-edge connected subgraph problem 
    Mailfert, Jean; Mahjoub, Ali Ridha; Didi Biha, Mohamed; Ibrahima, Diarrassouba; Bendali, Fatiha (2010) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo