A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane

Authors:
Nir Halman
Affiliations:
School of Mathematical Sciences, Tel Aviv University, Tel Aviv 69978, Israel
Venue:
Information Processing Letters
Year:
2003

Citing 5
Cited 2

On a multidimensional search technique and its application to the Euclidean one centre problem

SIAM Journal on Computing
Introduction to algorithms

Introduction to algorithms
Rectilinear and polygonal p-piercing and p-center problems

Proceedings of the twelfth annual symposium on Computational geometry
On the Optimality of Some Set Algorithms

Journal of the ACM (JACM)
Linear Programming in Linear Time When the Dimension Is Fixed

Journal of the ACM (JACM)

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

Information Processing Letters
Sorting weighted distances with applications to objective function evaluations in single facility location problems

Operations Research Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present an optimal O(n) time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane and prove that calculating the optimal value of the objective function requires Θ(n log n) time.