Almost Tight Bounds for Online Facility Location in the Random-Order Model

07/18/2022
by   Haim Kaplan, et al.
0

We study the online facility location problem with uniform facility costs in the random-order model. Meyerson's algorithm [FOCS'01] is arguably the most natural and simple online algorithm for the problem with several advantages and appealing properties. Its analysis in the random-order model is one of the cornerstones of random-order analysis beyond the secretary problem. Meyerson's algorithm was shown to be (asymptotically) optimal in the standard worst-case adversarial-order model and 8-competitive in the random order model. While this bound in the random-order model is the long-standing state-of-the-art, it is not known to be tight, and the true competitive-ratio of Meyerson's algorithm remained an open question for more than two decades. We resolve this question and prove tight bounds on the competitive-ratio of Meyerson's algorithm in the random-order model, showing that it is exactly 4-competitive. Following our tight analysis, we introduce a generic parameterized version of Meyerson's algorithm that retains all the advantages of the original version. We show that the best algorithm in this family is exactly 3-competitive. On the other hand, we show that no online algorithm for this problem can achieve a competitive-ratio better than 2. Finally, we prove that the algorithms in this family are robust to partial adversarial arrival orders.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/11/2019

Competitive Analysis with a Sample and the Secretary Problem

We extend the standard online worst-case model to accommodate past exper...
research
08/15/2023

A Tight Competitive Ratio for Online Submodular Welfare Maximization

In this paper we consider the online Submodular Welfare (SW) problem. In...
research
07/01/2019

Online Multidimensional Packing Problems in the Random-Order Model

We study online multidimensional variants of the generalized assignment ...
research
03/27/2023

Online k-Median with Consistent Clusters

We consider the online k-median clustering problem in which n points arr...
research
11/26/2017

Online Facility Location on Semi-Random Streams

In the streaming model, the order of the stream can significantly affect...
research
01/26/2021

Online Network Utility Maximization: Algorithm, Competitive Analysis, and Applications

We consider an online version of the well-studied network utility maximi...
research
02/10/2023

Online Algorithms with Randomly Infused Advice

We introduce a novel method for the rigorous quantitative evaluation of ...

Please sign up or login with your details

Forgot password? Click here to reset