Fast algorithms for min independent dominating set

Details Fast algorithms for min independent dominating set Fast algorithms for min independent dominating set

2009-05-13

arxiv.org/abs/0905.1993v1

Computer Science

Data Structures and Algorithms

Scientific paper

We first devise a branching algorithm that computes a minimum independent dominating set on any graph with running time O*(2^0.424n) and polynomial space. This improves the O*(2^0.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 show that, for every r>3, it is possible to compute an r-((r-1)/r)log_2(r)-approximate solution for min independent dominating set within time O*(2^(nlog_2(r)/r)).

Affiliated with

Also associated with

No associations

Rating

Fast algorithms for min independent dominating set does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast algorithms for min independent dominating set, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast algorithms for min independent dominating set will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-128483