Fast algorithms for min independent dominating set - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Fast algorithms for min independent dominating set

Résumé

We first devise a branching algorithm that computes a minimum independent dominating set with running time O∗(1.3351n)=O∗(20.417n)O∗(1.3351n)=O∗(20.417n) and polynomial space. This improves upon the best state of the art algorithms for this problem. We then study approximation of the problem by moderately exponential time algorithms and show that it can be approximated within ratio 1+ϵ1+ϵ, for any ϵ>0ϵ>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 in general graphs and give improved moderately exponential time approximation results in triangle-free and bipartite graphs. These latter results are based upon a new bound on the number of maximal independent sets of a given size in these graphs, which is a result interesting per se.

Dates et versions

hal-01508849 , version 1 (14-04-2017)

Identifiants

Citer

Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Paschos. Fast algorithms for min independent dominating set. Seventh International Conference on Graphs and Optimization 2010, Jun 2010, Ovronnaz, Switzerland. pp.558-572, ⟨10.1016/j.dam.2012.01.003⟩. ⟨hal-01508849⟩
71 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More