Results 1  10
of
317
Online Facility Location
"... We consider the online variant of facility location, in which demand points arrive one at a time and we must maintain a set of facilities to service these points. We provide a randomized online O(1)competitive algorithm in the case where points arrive in random order. If points are ordered adversar ..."
Abstract

Cited by 71 (6 self)
 Add to MetaCart
We consider the online variant of facility location, in which demand points arrive one at a time and we must maintain a set of facilities to service these points. We provide a randomized online O(1)competitive algorithm in the case where points arrive in random order. If points are ordered
Planar Point Location Using Persistent Search Trees
, 1986
"... A classical problem in computational geometry is the planar point location problem. This problem calls for preprocessing a polygonal subdivision of the plane defined by n line segments so that, given a sequence of points, the polygon containing each point can be determined quickly online. Several ..."
Abstract

Cited by 177 (4 self)
 Add to MetaCart
A classical problem in computational geometry is the planar point location problem. This problem calls for preprocessing a polygonal subdivision of the plane defined by n line segments so that, given a sequence of points, the polygon containing each point can be determined quickly online
On the competitive ratio for online facility location
 In ICALP
, 2003
"... Abstract. We consider the problem of Online Facility Location, where demands arrive online and must be irrevocably assigned to an open facility upon arrival. The objective is to minimize the sum of facility and assignment costs. We prove that the competitive log n ratio for Online Facility Location ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
Abstract. We consider the problem of Online Facility Location, where demands arrive online and must be irrevocably assigned to an open facility upon arrival. The objective is to minimize the sum of facility and assignment costs. We prove that the competitive log n ratio for Online Facility Location
Online Connected Facility Location problem.
, 2014
"... First we show some problems that are useful to understand the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
First we show some problems that are useful to understand the
The online connected facility location problem
, 2013
"... Maximization or minimization problems in which, for each input there is a set of feasible solutions and, for each solution there is a cost associated with it. ..."
Abstract
 Add to MetaCart
Maximization or minimization problems in which, for each input there is a set of feasible solutions and, for each solution there is a cost associated with it.
Facility Location family problems, Online Connected Facility Location problem.
, 2015
"... Competitive Analysis of the Online SingleSource RentorBuy algorithm. Mário César San Felice (IMEUSP) O projeto de algoritmos online competitivos 23 de junho de 2015 2 / 38 ..."
Abstract
 Add to MetaCart
Competitive Analysis of the Online SingleSource RentorBuy algorithm. Mário César San Felice (IMEUSP) O projeto de algoritmos online competitivos 23 de junho de 2015 2 / 38
The Online PrizeCollecting Facility Location Problem
, 2015
"... Problems in which an objective function needs to be minimized or maximized. Minimization problems in which we are interested: Facility Location problem, PrizeCollecting Facility Location problem. These problems are NPhard and constant factor approximation algorithms are known for them. ..."
Abstract
 Add to MetaCart
Problems in which an objective function needs to be minimized or maximized. Minimization problems in which we are interested: Facility Location problem, PrizeCollecting Facility Location problem. These problems are NPhard and constant factor approximation algorithms are known for them.
The Online Median Problem
 In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science
, 2000
"... We introduce a natural variant of the (metric uncapacitated) kmedian problem that we call the online median problem. Whereas the kmedian problem involves optimizing the simultaneous placement of k facilities, the online median problem imposes the following additional constraints: the facilities ar ..."
Abstract

Cited by 82 (2 self)
 Add to MetaCart
to that of an optimal offline placement. Our main result is a lineartime constantcompetitive algorithm for the online median problem. In addition, we present a related, though substantially simpler, lineartime constantfactor approximation algorithm for the (metric uncapacitated) facility location problem
A Simple and Deterministic Competitive Algorithm for Online Facility Location
, 2003
"... This paper presents a deterministic and efficient algorithm for online facility location. The algorithm is based on a simple hierarchical partitioning and is extremely simple to implement. It also applies to a variety of models, i.e., models where the facilities can be placed anywhere in the region, ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
This paper presents a deterministic and efficient algorithm for online facility location. The algorithm is based on a simple hierarchical partitioning and is extremely simple to implement. It also applies to a variety of models, i.e., models where the facilities can be placed anywhere in the region
Results 1  10
of
317