Thresholded Covering Algorithms for Robust and Max-Min Optimization

Details Thresholded Covering Algorithms for Robust and Max-Min Optimization Thresholded Covering Algorithms for Robust and Max-Min Optimization

2009-12-05

arxiv.org/abs/0912.1045v3

Computer Science

Data Structures and Algorithms

24 pages

Scientific paper

The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should you anticipatorily buy today, so that the worst-case cost (summed over both days) is minimized? Feige et al. and Khandekar et al. considered the k-robust model where the possible outcomes tomorrow are given by all demand-subsets of size k, and gave algorithms for the set cover problem, and the Steiner tree and facility location problems in this model, respectively. In this paper, we give the following simple and intuitive template for k-robust problems: "having built some anticipatory solution, if there exists a single demand whose augmentation cost is larger than some threshold, augment the anticipatory solution to cover this demand as well, and repeat". In this paper we show that this template gives us improved approximation algorithms for k-robust Steiner tree and set cover, and the first approximation algorithms for k-robust Steiner forest, minimum-cut and multicut. All our approximation ratios (except for multicut) are almost best possible. As a by-product of our techniques, we also get algorithms for max-min problems of the form: "given a covering problem instance, which k of the elements are costliest to cover?".

Affiliated with

Also associated with

No associations

Rating

Thresholded Covering Algorithms for Robust and Max-Min Optimization 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 Thresholded Covering Algorithms for Robust and Max-Min Optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Thresholded Covering Algorithms for Robust and Max-Min Optimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-706688