Greedy Set Cover Estimations

Details Greedy Set Cover Estimations Greedy Set Cover Estimations

2011-07-21

arxiv.org/abs/1107.4224v1

International Conference on Computer Science and Information Technologies. CSIT2003: 143-144, Yerevan, Armenia 2003

Computer Science

Discrete Mathematics

Scientific paper

More precise estimation of the greedy algorithm complexity for a special case
of the set cover problem is given in this paper.

Affiliated with

Also associated with

No associations

Rating

Greedy Set Cover Estimations 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 Greedy Set Cover Estimations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Greedy Set Cover Estimations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-687721