A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane
From MaRDI portal
Publication:1007585
DOI10.1016/S0020-0190(02)00489-1zbMATH Open1173.68820OpenAlexW2011506346MaRDI QIDQ1007585FDOQ1007585
Authors: Nir Halman 
Publication date: 23 March 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00489-1
Recommendations
Cites Work
- Title not available (Why is that?)
- The Weighted Euclidean 1-Center Problem
- On the lexicographic minimax approach to location problems
- Linear Programming in Linear Time When the Dimension Is Fixed
- On the rectangularp-center problem
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Time bounds for selection
- The Nucleolus as a Solution of a Minimization Problem
- Title not available (Why is that?)
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
- The power of geometric duality revisited
- On the Optimality of Some Set Algorithms
Cited In (6)
- Sorting weighted distances with applications to objective function evaluations in single facility location problems.
- Multi-dimensional dynamic facility location and fast computation at query points
- Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p
- The Weighted Euclidean 1-Center Problem
- An algorithm and a core set result for the weighted Euclidean one-center problem
- Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under \(l_ \infty\)-distance
This page was built for publication: A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007585)
