Advanced search
Start date
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

A Randomized -Competitive Algorithm for the Online Connected Facility Location Problem

Full text
San Felice, Mario Cesar ; Williamson, David P. ; Lee, Orlando
Total Authors: 3
Document type: Journal article
Source: ALGORITHMICA; v. 76, n. 4, p. 1139-1157, DEC 2016.
Web of Science Citations: 0

The Connected Facility Location (CFL) is a network design problem that arises from a combination of the Uncapacitated Facility Location (FL) and the Steiner Tree (ST) problems. The Online Connected Facility Location problem (OCFL) is an online version of the CFL. San Felice et al. (2014) presented a randomized algorithm for the OCFL and proved that it is -competitive, where n is the number of clients. That algorithm combines the sample-and-augment framework of Gupta, Kumar, Pal, and Roughgarden with previous algorithms for the Online Facility Location (OFL) and the Online Steiner Tree (OST) problems. In this paper we use a more precise analysis to show that the same algorithm is -competitive. Since there is a lower bound of for this problem, our result achieves the best possible competitive ratio, asymptotically. (AU)

FAPESP's process: 09/15535-1 - Facility Location Problems
Grantee:Mário César San Felice
Support type: Scholarships in Brazil - Doctorate