Thresholded Covering Algorithms for Robust and Max-min Optimization

DOI10.1007/978-3-642-14165-2_23zbMATH Open1287.68180arXiv0912.1045OpenAlexW2115519003MaRDI QIDQ3587385FDOQ3587385

Authors: Anupam Gupta, Viswanath Nagarajan, R. Ravi 

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Abstract: 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?".

Full work available at URL: https://arxiv.org/abs/0912.1045

Recommendations

• Thresholded covering algorithms for robust and max-min optimization
• Formulation and algorithms for the robust maximal covering location problem
• Reoptimization of max \(k\)-cover: approximation ratio threshold
• On minquantile and maxcovering optimisation
• Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
• Robust min-max regret covering problems
• Thresholding algorithms, maxisets and well-concentrated bases
• Thrifty algorithms for multistage robust optimization
• Min-max-min robust combinatorial optimization
• Adaptive thresholding technique for solving optimization problems on attainable sets of \((\max,\min)\)-linear systems.

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Cited In (12)

• Robust multicovers: algorithms and complexity
• Title not available (Why is that?)
• Approximating max-min weighted \(T\)-joins
• Robust multicovers with budgeted uncertainty
• Thresholded covering algorithms for robust and max-min optimization
• Robust Combinatorial Optimization with Exponential Scenarios
• Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems
• Thrifty algorithms for multistage robust optimization
• Maxisets for \(\mu \) -thresholding rules
• Two-stage robust network design with exponential scenarios
• Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty
• Two-Stage Robust Network Design with Exponential Scenarios

This page was built for publication: Thresholded Covering Algorithms for Robust and Max-min Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3587385)