The Batched Set Cover Problem

11/27/2018
by   Juan C. Martínez Mori, et al.
0

We introduce the batched set cover problem, which is a generalization of the online set cover problem. In this problem, the elements of the ground set that need to be covered arrive in batches. Our main technical contribution is a tight Ω(H_m - 2^z + 1) lower bound on the competitive ratio of any fractional batched algorithm given an adversary that is required to produce batches of VC-dimension at least z, for some z ∈N^0. This restriction on the adversary is motivated by the fact that, in some real world applications, decisions are made after collecting batches of data of non-trivial VC-dimension. In particular, ridesharing systems rely on the batch assignment of trip requests to vehicles, and some related problems such as that of optimal congregation points for passenger pickups and dropoffs can be modeled as a batched set cover problem with VC-dimension greater than or equal to two. Furthermore, we note that while any online algorithm may be used to solve the batched set cover problem by artificially sequencing the elements in a batch, this procedure may neglect the rich information encoded in the complex interactions between the elements of a batch and the sets that contain them. Therefore, we propose a minor modification to an online algorithm found in [8] to obtain an algorithm that attempts to exploit such information. Unfortunately, we are unable to improve its analysis in a way that reflects this intuition. However, we present computational experiments that provide empirical evidence of a constant factor improvement in the competitive ratio. To the best of our knowledge, we are the first to use the VC-dimension in the context of online (batched) covering problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/23/2018

Set Cover and Vertex Cover with Delay

The set cover problem is one of the most fundamental problems in compute...
research
05/09/2023

Constant-Competitiveness for Random Assignment Matroid Secretary Without Knowing the Matroid

The Matroid Secretary Conjecture is a notorious open problem in online o...
research
06/30/2023

An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem

We study the online variant of the Min-Sum Set Cover (MSSC) problem, a g...
research
08/14/2023

Online Class Cover Problem

In this paper, we study the online class cover problem where a (finite o...
research
08/12/2020

Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems

We show that Set Cover on instances with N elements cannot be approximat...
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/15/2021

A Chronology of Set Cover Inapproximability Results

It is well-known that an algorithm exists which approximates the NP-comp...

Please sign up or login with your details

Forgot password? Click here to reset