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

DOI10.1016/j.ipl.2008.12.014zbMath1191.68751OpenAlexW2054190241MaRDI QIDQ976128

Daniel Berend, Shimon Abravaya

Publication date: 16 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.12.014

zbMATH Keywords

facility locationcomputational geometryminimax criterion

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane
• Minimizing the sum of the \(k\) largest functions in linear time.
• The Weighted Euclidean 1-Center Problem
• Linear Programming in Linear Time When the Dimension Is Fixed
• On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
• Unnamed Item