Efficient algorithms for optimization and selection on series-parallel graphs
SIAM Journal on Algebraic and Discrete Methods
e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Approximation algorithms for geometric median problems
Information Processing Letters
On some optimization problems on k-trees and partial k-trees
Discrete Applied Mathematics
Approximation schemes for Euclidean k-medians and related problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Local search heuristic for k-median and facility location problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Maintaining Center and Median in Dynamic Trees
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Quick k-Median, k-Center, and Facility Location for Sparse Graphs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Algorithms for Efficient Filtering in Content-Based Multicast
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Polygon visibility decompositions with applications
Polygon visibility decompositions with applications
Cardinality constrained facility location problems in trees
Cardinality constrained facility location problems in trees
An O(pn2) algorithm for the p -median and related problems on tree graphs
Operations Research Letters
The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers
Theoretical Computer Science
Optimizing server placement in distributed systems in the presence of competition
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
We propose an O(n logp+2n) algorithm for solving the well-known p-Median problem for trees. Our analysis relies on the fact that p is considered constant (in practice, very often p n). This is the first result in almost 25 years that proposes a new algorithm for solving this problem, opening up several new avenues for research.