Constructing arrangements of lines and hyperplanes with applications
SIAM Journal on Computing
On k-hulls and related problems
SIAM Journal on Computing
A generalized algorithm for centrality problems on trees
Journal of the ACM (JACM)
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
Dynamic Maintenance of Maxima of 2-d Point Sets
SIAM Journal on Computing
The k-centrum multi-faculty location problem
Discrete Applied Mathematics
Taking a Walk in a Planar Arrangement
SIAM Journal on Computing
Minimizing the sum of the k largest functions in linear time
Information Processing Letters
A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane
Information Processing Letters
An O(pn2) algorithm for the p -median and related problems on tree graphs
Operations Research Letters
Algorithmic results for ordered median problems
Operations Research Letters
A generalized model of equality measures in network location problems
Computers and Operations Research
Range minimization problems in path-facility location on trees
Discrete Applied Mathematics
| Hi-index | 0.00 |
We consider single facility location problems defined on rectilinear spaces and spaces induced by tree networks. We focus on discrete cases, where the facility is restricted to be in a prespecified finite set S, and the goal is to evaluate the objective at each point in S. We present efficient improved algorithms to perform this task for several classes of objective functions.