A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane
From MaRDI portal
(Redirected from Publication:1007585)
Recommendations
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3493798 (Why is no real title available?)
- Linear Programming in Linear Time When the Dimension Is Fixed
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
- On the Optimality of Some Set Algorithms
- On the lexicographic minimax approach to location problems
- On the rectangularp-center problem
- The Nucleolus as a Solution of a Minimization Problem
- The Weighted Euclidean 1-Center Problem
- The power of geometric duality revisited
- Time bounds for selection
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)
