Multi-dimensional dynamic facility location and fast computation at query points

S. Abravaya, D. Berend

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


We present O (n log n) time algorithms for the minimax rectilinear facility location problem in R1 and R2. The algorithms enable, once they terminate, computing the cost of any given query point in O (log n) time. Based on these algorithms, we develop a preprocessing procedure which enables solving the following two problems: Fast computation of the cost of any query point in Rd, and fast solution for the dynamic location problem in R2 (namely, in the presence of an additional facility). Finally, we show that the preprocessing always gives a bound on the optimal value, which allows us in many cases to find the optimum fast (for both the traditional and the dynamic location problems in Rd for any d).

Original languageEnglish
Pages (from-to)386-390
Number of pages5
JournalInformation Processing Letters
Issue number8
StatePublished - 31 Mar 2009


  • Computational geometry
  • Facility location
  • Minimax criterion

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'Multi-dimensional dynamic facility location and fast computation at query points'. Together they form a unique fingerprint.

Cite this