Greedy D-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost

Details Greedy D-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost Greedy D-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost

2008-07-04

arxiv.org/abs/0807.0644v4

Computer Science

Data Structures and Algorithms

Scientific paper

This paper describes a simple greedy D-approximation algorithm for any covering problem whose objective function is submodular and non-decreasing, and whose feasible region can be expressed as the intersection of arbitrary (closed upwards) covering constraints, each of which constrains at most D variables of the problem. (A simple example is Vertex Cover, with D = 2.) The algorithm generalizes previous approximation algorithms for fundamental covering problems and online paging and caching problems.

Affiliated with

Also associated with

No associations

Rating

Greedy D-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost 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 D-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Greedy D-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-447638