A Note on: `Algorithms for Connected Set Cover Problem and Fault-Tolerant Connected Set Cover Problem'

Details A Note on: `Algorithms for Connected Set Cover Problem and Fault-Tolerant Connected Set Cover Problem' A Note on: `Algorithms for Connected Set Cover Problem and Fault-Tolerant Connected Set Cover Problem'

2011-04-05

arxiv.org/abs/1104.0733v1

Computer Science

Data Structures and Algorithms

6 pages, 1 figure, submitted to Theoretical Computer Science

Scientific paper

A flaw in the greedy approximation algorithm proposed by Zhang et al. for
minimum connected set cover problem is corrected, and a stronger result on the
approximation ratio of the modified greedy algorithm is established. The
results are now consistent with the existing results on connected dominating
set problem which is a special case of the minimum connected set cover problem.

Affiliated with

Also associated with

No associations

Rating

A Note on: `Algorithms for Connected Set Cover Problem and Fault-Tolerant Connected Set Cover Problem' 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 A Note on: `Algorithms for Connected Set Cover Problem and Fault-Tolerant Connected Set Cover Problem', we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Note on: `Algorithms for Connected Set Cover Problem and Fault-Tolerant Connected Set Cover Problem' will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-320800