Thrifty Algorithms for Multistage Robust Optimization

Anupam Gupta; Viswanath Nagarajan; Vijay V. Vazirani

Home/Archive/arXiv

arXiv · 1302.5445

Thrifty Algorithms for Multistage Robust Optimization

Anupam Gupta·Viswanath Nagarajan·Vijay V. Vazirani

View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider a class of multi-stage robust covering problems, where additional information is revealed about the problem instance in each stage, but the cost of taking actions increases. The dilemma for the decision-maker is whether to wait for additional information and risk the inflation, or to take early actions to hedge against rising costs. We study the "k-robust" uncertainty model: in each stage i = 0, 1,...,T, the algorithm is shown some subset of size k_i that completely contains the eventual demands to be covered; here k_1 > k_2 >...> k_T which ensures increasing information over time. The goal is to minimize the cost incurred in the worst-case possible sequence of revelations. For the multistage k-robust set cover problem, we give an O(log m + log n)-approximation algorithm, nearly matching the \Omega(log n + log m/loglog m) hardness of approximation even for T=2 stages. Moreover, our algorithm has a useful "thrifty" property: it takes actions on just two stages. We show similar thrifty algorithms for multi-stage k-robust Steiner tree, Steiner forest, and minimum-cut. For these problems our approximation guarantees are O(min{T, log n, log L_{max}), where L_{max} is the maximum inflation over all the stages. We conjecture that these problems also admit O(1)-approximate thrifty algorithms.

Explore related subjects

cs.DS

Keep this discovery

BibTeX RIS

Anupam Gupta, Viswanath Nagarajan, Vijay V. Vazirani. 2013-02-21. Thrifty Algorithms for Multistage Robust Optimization. https://arxiv.org/abs/1302.5445

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗

arXiv2026

A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix

For every fixed $0<\varepsilon\le1$, we give a deterministic strongly polynomial algorithm that, given a nonnegative matrix $A\in\mathbb{R}_{\ge0}^{n\times n}$, returns $Q$ satisfying $\operatorname{per} A\le Q\le(1+\varepsilon)^n\operatorname{per} A$.

cs.DS↗

arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗