Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Dynamic and static algorithms for optimal placement of resources in a tree
Theoretical Computer Science
Approximation schemes for Euclidean k-medians and related problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Placing resources on a growing line
Journal of Algorithms
A constant-factor approximation algorithm for the k-median problem (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Finding subsets maximizing minimum structures
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
An algorithm for finding a K-median in a directed tree
Information Processing Letters - Special issue analytical theory of fuzzy control with applications
Analysis of a local search heuristic for facility location problems
Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the Optimal Placement of Web Proxies in the Internet: The Linear Topology
HPN '98 Proceedings of the IFIP TC-6 Eigth International Conference on High Performance Networking
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Monge strikes again: optimal placement of web proxies in the internet
Operations Research Letters
An O(pn2) algorithm for the p -median and related problems on tree graphs
Operations Research Letters
| Hi-index | 0.00 |
The k-median problem is a classical facility location problem. We consider the k-median problem for directed trees, motivated by the problem of locatingp roxies on the World Wide Web. The two main results of the paper are an O(n log n) time algorithm for k=2 and an O(n log2 n) time algorithm for k=3. The previously known upper bounds for these two cases were O(n2).