Set Cover and Vertex Cover with Delay

07/23/2018
by   Yossi Azar, et al.
0

The set cover problem is one of the most fundamental problems in computer science. We present the problem of online set cover with delay (SCD). A family of sets with costs and a universe of elements are known in advance. Requests then arrive over time on the elements, and each request accumulates delay cost until served by the algorithm through buying a containing set. A request can only be served by sets that are bought after the request's arrival, and thus a set may be bought an unbounded number of times over the course of the algorithm. This property sets SCD apart from previous considerations of set cover in the online setting, in which there are no delays, elements are covered immediately, and sets stay bought permanently. This allows SCD to describe an unbounded process, with an unlimited number of requests for any given universe. For the SCD problem, we show an O( k· n)-competitive randomized algorithm, where n is the number of elements and k is the maximum number of sets containing any single element. We also show a lower bound of Ω(√( k)) and Ω(√( n)) on the competitiveness of any algorithm for SCD. For the special case of Vertex Cover with Delay (VCD), we show a simple 3-competitive deterministic algorithm. The O( k· n)-competitive algorithm is based on exponential weights combined with the max operator (in contrast to most algorithms employing exponential weights, which use summation). The lower bound is described by a recursive construction.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/04/2022

Online Matching with Set Delay

We initiate the study of online problems with set delay, where the delay...
research
07/14/2023

Delaying Decisions and Reservation Costs

We study the Feedback Vertex Set and the Vertex Cover problem in a natur...
research
11/27/2018

The Batched Set Cover Problem

We introduce the batched set cover problem, which is a generalization of...
research
04/13/2023

List Update with Delays or Time Windows

We consider the problem of List Update, one of the most fundamental prob...
research
02/16/2021

Maximum Coverage in the Data Stream Model: Parameterized and Generalized

We present algorithms for the Max-Cover and Max-Unique-Cover problems in...
research
06/06/2023

Buying Information for Stochastic Optimization

Stochastic optimization is one of the central problems in Machine Learni...
research
02/20/2019

Competitive Concurrent Distributed Scheduling

We introduce a new scheduling problem in distributed computing that we c...

Please sign up or login with your details

Forgot password? Click here to reset