• 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

Fast Algorithms for min independent dominating set

Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis (2010), Fast Algorithms for min independent dominating set, in Patt-Shamir, Boaz; Ekim, Tinaz, Structural Information and Communication Complexity, 17th International Colloquium, SIROCCO 2010, Sirince, Turkey, June 7-11, 2010. Proceedings., Springer : Berlin, p. 247-261

View/Open
742A7CC2d01.pdf (148.4Kb)
Type
Communication / Conférence
Date
2010
Conference title
SIROCCO 2010: 17th International Colloquium on Structural Information and Communication Complexity
Conference date
2010-06
Conference city
Sirince
Conference country
Turquie
Book title
Structural Information and Communication Complexity, 17th International Colloquium, SIROCCO 2010, Sirince, Turkey, June 7-11, 2010. Proceedings.
Book author
Patt-Shamir, Boaz; Ekim, Tinaz
Publisher
Springer
Series title
Lecture Notes in Computer Science
Series number
6058
Published in
Berlin
ISBN
978-3-642-13283-4
Pages
247-261
Publication identifier
http://dx.doi.org/10.1007/978-3-642-13284-1_20
Metadata
Show full item record
Author(s)
Bourgeois, Nicolas
Escoffier, Bruno
Paschos, Vangelis
Abstract (EN)
We first devise a branching algorithm that computes a minimum independent dominating set with running time O *(20.424n ) and polynomial space. This improves the O *(20.441n ) result by (S. Gaspers and M. Liedloff, A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs, Proc. WG’06). We then study approximation of the problem by moderately exponential algorithms and show that it can be approximated within ratio 1 + ε, for any ε> 0, in a time smaller than the one of exact computation and exponentially decreasing with ε. We also propose approximation algorithms with better running times for ratios greater than 3.
Subjects / Keywords
min independent dominating set

Related items

Showing items related by title and author.

  • Thumbnail
    Fast algorithms for min independent dominating set 
    Bourgeois, Nicolas; Della Croce, Federico; Escoffier, Bruno; Paschos, Vangelis (2013) Communication / Conférence
  • Thumbnail
    A Bottom-Up Method and Fast Algorithms for max independent set 
    Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis (2010) Communication / Conférence
  • Thumbnail
    Fast Algorithms for max independent set 
    Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis; Van Rooij, Johan (2012) Article accepté pour publication ou publié
  • Thumbnail
    Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms 
    Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis (2011) Article accepté pour publication ou publié
  • Thumbnail
    An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs 
    Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis (2008) Communication / Conférence
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