Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty
share
In this paper we study how to optimally balance cheap inflexible resources with more expensive, reconfigurable resources despite uncertainty in the input problem. Specifically, we introduce the MinEMax model to study "build versus rent" problems. In our model different scenarios appear independently. Before knowing which scenarios appear, we may build rigid resources that cannot be changed for different scenarios. Once we know which scenarios appear, we are allowed to rent reconfigurable but expensive resources to use across scenarios. While the objective in our model is difficult to compute, we show it is well-estimated by a surrogate objective which is representable by an LP. In this surrogate objective we pay for each scenario only to the extent that it exceeds a certain threshold. Using this objective we design algorithms that approximately-optimally balance inflexible and reconfigurable resources for several NP-hard covering problems. For example, we study minimum spanning and Steiner trees, minimum cuts and facility location variants. Up to constants our approximation guarantees match those of previous algorithms for the previously-studied demand-robust and stochastic two-stage models. Lastly, we demonstrate that our problem is sufficiently general to smoothly interpolate between previous demand-robust and stochastic two-stage problems.
READ FULL TEXT