The Cache Location Problem

2004 ◽  
pp. 67-98
Author(s):  
Cheng Jin ◽  
Sugih Jamin ◽  
Danny Raz ◽  
Yuval Shavitt
Keyword(s):  
Location Problem ◽  
Cache Location

The cache location problem

2000 ◽  
Vol 8 (5) ◽  
pp. 568-582 ◽  
Author(s):  
P. Krishnan ◽  
D. Raz ◽  
Y. Shavitt
Keyword(s):  
Location Problem ◽  
Cache Location

scholarly journals Weighted Cache Location Problem with Identical Servers

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Hongfa Wang ◽  
Wei Ding
Keyword(s):  
Parallel Algorithm ◽  
Numerical Experiments ◽  
Location Problem ◽  
Exact Algorithm ◽  
Worst Case ◽  
Shortest Route ◽  
General Network ◽  
Cache Location

This paper extends the well-knownp-CLP with one server top-CLP withm≥2identical servers, denoted by(p,m)-CLP. We propose the closest server orienting protocol (CSOP), under which every client connects to the closest server to itself via a shortest route on given network. We abbreviate(p,m)-CLP under CSOP to(p,m)-CSOP CLP and investigate that(p,m)-CSOP CLP on a general network is equivalent to that on a forest and further to multiple CLPs on trees. The case ofm=2is the focus of this paper. We first devise an improvedO(ph2+n)-time parallel exact algorithm forp-CLP on a tree and then present a parallel exact algorithm with at mostO((4/9)p2n2)time in the worst case for(p,2)-CSOP CLP on a general network. Furthermore, we extend the idea of parallel algorithm to the cases ofm>2to obtain a worst-caseO((4/9)(n-m)2((m+p)p/p-1!))-time exact algorithm. At the end of the paper, we first give an example to illustrate our algorithms and then make a series of numerical experiments to compare the running times of our algorithms.

The Gradual Minimal Covering Location Problem

2020 ◽  
Author(s):  
Mostafa Khatami ◽  
Amir Salehipour
Keyword(s):  
Location Problem ◽  
Minimal Covering

The Multi-Commodity Facilities Location Problem

1981 ◽  
Vol 32 (9) ◽  
pp. 803 ◽  
Author(s):  
J. Karkazis ◽  
T. B. Boffey
Keyword(s):  
Location Problem ◽  
Facilities Location

scholarly journals Location Problem of Production and Sales under Carbon Tax Policy

2020 ◽  
Vol 1575 ◽  
pp. 012188
Author(s):  
Chong Xiang ◽  
Xiaoshen Li ◽  
Guanglei Sun
Keyword(s):  
Tax Policy ◽  
Location Problem ◽  
Carbon Tax

scholarly journals Dispersing Obnoxious Facilities on a Graph

Algorithmica ◽  
2021 ◽  
Author(s):  
Alexander Grigoriev ◽  
Tim A. Hartmann ◽  
Stefan Lendl ◽  
Gerhard J. Woeginger
Keyword(s):  
Facility Location ◽  
Location Problem ◽  
Unit Length ◽  
Facility Location Problem ◽  
Np Hard ◽  
Obnoxious Facilities ◽  
Rational Parameter ◽  
Polynomially Solvable

AbstractWe study a continuous facility location problem on a graph where all edges have unit length and where the facilities may also be positioned in the interior of the edges. The goal is to position as many facilities as possible subject to the condition that any two facilities have at least distance $$\delta$$ δ from each other. We investigate the complexity of this problem in terms of the rational parameter $$\delta$$ δ . The problem is polynomially solvable, if the numerator of $$\delta$$ δ is 1 or 2, while all other cases turn out to be NP-hard.

Sign in / Sign up

Export Citation Format

Share Document