Reallocating Multiple Facilities on the Line

@article{Fotakis2019ReallocatingMF,
  title={Reallocating Multiple Facilities on the Line},
  author={Dimitris Fotakis and Loukas Kavouras and Panagiotis Kostopanagiotis and Philip Lazos and Stratis Skoulakis and Nikolas Zarifis},
  journal={ArXiv},
  year={2019},
  volume={abs/1905.12379}
}
We study the multistage K-facility reallocation problem on the real line, where we maintain K facility locations over T stages, based on the stage-dependent locations of n agents. Each agent is connected to the nearest facility at each stage, and the facilities may move from one stage to another, to accommodate different agent locations. The objective is to minimize the connection cost of the agents plus the total moving cost of the facilities, over all stages. K-facility reallocation problem… 

Figures from this paper

Facility Reallocation on the Line
TLDR
This work considers a multi-stage facility reallocation problems on the real line, where a facility is being moved between stages based on the locations reported by n agents, and proposes another strategyproof mechanism which has a competitive ratio of (n+3)/(n+1) for odd n and ( n+4)/n for even n, which it conjecture to be the best possible.
Mobile resource allocation
TLDR
This thesis covers the topic of resource allocation problems that are tailored to scenarios primarily involving mobile users, and proposes online algorithms that achieve competitive ratios independent of time and the number of clients.
Mechanism Design for Facility Location Problems: A Survey
TLDR
A comprehensive survey of the significant progress that has been made since the introduction of the approximate mechanism design problem is presented, highlighting the different variants and methodologies, as well as the most interesting directions for future research.
Efficient Online Learning for Dynamic k-Clustering
TLDR
An online learning problem, called Dynamic kClustering, in which k centers are maintained in a metric space over time (centers may change positions) such as a dynamically changing set of r clients is served in the best possible way and this work contributes to the long line of research on combinatorial online learning.

References

SHOWING 1-10 OF 57 REFERENCES
Facility Reallocation on the Line
TLDR
This work considers a multi-stage facility reallocation problems on the real line, where a facility is being moved between stages based on the locations reported by n agents, and proposes another strategyproof mechanism which has a competitive ratio of (n+3)/(n+1) for odd n and ( n+4)/n for even n, which it conjecture to be the best possible.
Incremental algorithms for Facility Location and k-Median
Online and incremental algorithms for facility location
TLDR
All known online and incremental Facility Location algorithms are discussed, the intuition behind them and the main ideas of their competitive analysis are sketched, and some applications are discussed.
Minimizing Movement in Mobile Facility Location Problems
TLDR
This paper shows that the problem of minimizing the total movement of facilities and clients generalizes the classical k-median problem using an approximation preserving reduction, and presents an 8-approximation algorithm for the minimum maximum movement mobile facility location problem.
Online facility location with facility movements
TLDR
A new version of the online facility location problem, where the algorithm is allowed to move the opened facilities in the metric space, is considered and it is proved that no algorithm with smaller competitive ratio than $${(\sqrt{13}+1)/4\approx 1.1514}$$ exists.
Dynamic Facility Location via Exponential Clocks
TLDR
A new LP-rounding algorithm for facility location problems, which yields the first constant approximation algorithm for the dynamic facility location problem, and uses no clustering and allows clients to connect through paths of arbitrary lengths.
Online Facility Location with Mobile Facilities
TLDR
This work examines the Online Facility Location Problem in an augmented version, where the online algorithm is allowed to adapt the position of the facilities for costs proportional to the distance by which the position is changed, and proposes randomized online algorithms in two settings.
Dynamic Facility Location via Exponential Clocks
TLDR
A new LP-rounding algorithm for facility location problems, which yields the first constant approximation algorithm for the dynamic facility location problem, and uses no clustering and allows clients to connect through paths of arbitrary lengths.
Online facility location
  • A. Meyerson
  • Computer Science
    Proceedings 2001 IEEE International Conference on Cluster Computing
  • 2001
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
Facility Location in Evolving Metrics
TLDR
This work introduces a time-dependent, dynamic version of the facility location problem, which includes a switching cost when a client’s assignment changes from one facility to another, to provide a better representation of an evolving network.
...
1
2
3
4
5
...