When the Optimum is also Blind: a New Perspective on Universal Optimization

07/06/2017
by   Marek Adamczyk, et al.
0

Consider the following variant of the set cover problem. We are given a universe U={1,...,n} and a collection of subsets C = {S_1,...,S_m} where S_i ⊆ U. For every element u ∈ U we need to find a set ϕ(u) ∈ C such that u∈ϕ(u). Once we construct and fix the mapping ϕ:U →C a subset X ⊆ U of the universe is revealed, and we need to cover all elements from X with exactly ϕ(X):=∪_u∈ Xϕ(u). The goal is to find a mapping such that the cover ϕ(X) is as cheap as possible. This is an example of a universal problem where the solution has to be created before the actual instance to deal with is revealed. Such problems appear naturally in some settings when we need to optimize under uncertainty and it may be actually too expensive to begin finding a good solution once the input starts being revealed. A rich body of work was devoted to investigate the approximability of such problems under the regime of worst case analysis or when the input instance is drawn randomly from some probability distribution. Here one typically compares the quality of the produced solution with the optimal offline solution. In this paper we consider a different viewpoint: What if we would compare our approximate universal solution against an optimal universal solution that obeys the same rules as we do? We show that under this viewpoint it is possible to achieve improved approximation algorithms for the stochastic version of universal set cover. Our result is based on rounding a proper configuration IP that captures the optimal universal solution, and using tools from submodular optimization. The same basic approach leads to improved approximation algorithms also for other related problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/16/2019

Approximation Algorithms for Distributionally Robust Stochastic Optimization with Black-Box Distributions

Two-stage stochastic optimization is a framework for modeling uncertaint...
research
04/28/2021

Verified Approximation Algorithms

We present the first formal verification of approximation algorithms for...
research
04/04/2023

Set Covering with Our Eyes Wide Shut

In the stochastic set cover problem (Grandoni et al., FOCS '08), we are ...
research
06/27/2023

Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations

The goal of this paper is to understand how exponential-time approximati...
research
04/09/2018

Fully Dynamic Set Cover -- Improved and Simple

In this paper, we revisit the unweighted set cover problem in the fully ...
research
02/11/2019

A Simple Gap-producing Reduction for the Parameterized Set Cover Problem

Given an n-vertex bipartite graph I=(S,U,E), the goal of set cover probl...
research
11/17/2010

On the approximation ability of evolutionary optimization with application to minimum set cover

Evolutionary algorithms (EAs) are heuristic algorithms inspired by natur...

Please sign up or login with your details

Forgot password? Click here to reset