Fast algorithms for min independent dominating set
نویسندگان
چکیده
منابع مشابه
Fast Algorithms for min independent dominating set
We first devise a branching algorithm that computes a minimum independent dominating set with running time 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 + ε, for any ε > 0, in a time s...
متن کاملFast Dominating Set Algorithms for Social Networks
In this paper we introduce two novel algorithms that are able to efficiently determine an approximation to the minimum dominating set problem, and at the same time, they will preserve the quality of the solution to an acceptable level. We compare these two algorithms with three existing algorithms, for a large number of synthetic datasets, and for several real world social networks. For experim...
متن کاملFast, silent self-stabilizing distance-k independent dominating set construction
We propose a fast, silent self-stabilizing protocol building a distance-k independent dominating set, named FID. The convergence of the protocol FID is established for any computation under the unfair distributed scheduler. The protocol FID reaches a terminal (also legitimate) configuration in at most 4n+k rounds, where n is the network size; it requires (k + 1)log(n + 1) bits per node. keyword...
متن کاملFast self-stabilizing k-independent dominating set construction
We propose a fast silent self-stabilizing building a k-independent dominating set, named FID. The convergence of protocol FID, is established for any computation under the unfair distributed scheduler. FID reaches a terminal (also legitimate) configuration in at most 4n+k rounds, where n is the network size. FID requires (k + 1)log(n+ 1) bits per node. keywords distributed computing, fault tole...
متن کاملSemidefinite relaxation for dominating set
‎It is a well-known fact that finding a minimum dominating set and consequently the domination number of a general graph is an NP-complete problem‎. ‎In this paper‎, ‎we first model it as a nonlinear binary optimization problem and then extract two closely related semidefinite relaxations‎. ‎For each of these relaxations‎, ‎different rounding algorithm is exp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2013
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.01.003