Finding subsets maximizing minimum structures
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
The distance-domination numbers of trees
Operations Research Letters
Improved complexity bounds for location problems on the real line
Operations Research Letters
Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median
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
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
IEEE/ACM Transactions on Networking (TON)
Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems
IEEE Transactions on Parallel and Distributed Systems
High-density model for server allocation and placement
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Discrete Applied Mathematics - Special issue: Third ALIO-EURO meeting on applied combinatorial optimization
Optimal allocation of electronic content
Computer Networks: The International Journal of Computer and Telecommunications Networking
A constant-factor approximation algorithm for the k-median problem
Journal of Computer and System Sciences - STOC 1999
The k-Median Problem for Directed Trees
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Finding a Two-Core of a Tree in Linear Time
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
The Cent-dian Path Problem on Tree Networks
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Efficient Algorithms for Two Generalized 2-Median Problems on Trees
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Algorithms for Efficient Filtering in Content-Based Multicast
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Optimal placement of NAK-suppressing agents for reliable multicast: a partial deployment case
Proceedings of the 2004 ACM symposium on Applied computing
Joint object placement and node dimensioning for internet content distribution
Information Processing Letters
Finding r-Dominating Sets and p-Centers of Trees in Parallel
IEEE Transactions on Parallel and Distributed Systems
Efficient Dissemination of Personalized Information Using Content-Based Multicast
IEEE Transactions on Mobile Computing
Efficient algorithms for a constrained k-tree core problem in a tree network
Journal of Algorithms
Hierarchical topic segmentation of websites
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Optimal Replica Placement under TTL-Based Consistency
IEEE Transactions on Parallel and Distributed Systems
ACM Transactions on Knowledge Discovery from Data (TKDD)
Server placement in the presence of competition
GPC'07 Proceedings of the 2nd international conference on Advances in grid and pervasive computing
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Placing and maintaining a core node in wireless ad hoc sensor networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Locating facilities on a network to minimize their average service radius
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Scalable service migration in autonomic network environments
IEEE Journal on Selected Areas in Communications
Finding effectors in social networks
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Diameter-constrained steiner tree
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Cache location in tree networks: preliminary results
INOC'11 Proceedings of the 5th international conference on Network optimization
Minimizing metadata access latency in wide area networked file systems
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
A new template for solving p-median problems for trees in sub-quadratic time
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Reducing delivery delay in HRM tree
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
Approximation algorithms for the k-median problem
Efficient Approximation and Online Algorithms
On the exponential cardinality of FDS for the ordered p-median problem
Operations Research Letters
Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Optimizing client assignment for enhancing interactivity in distributed interactive applications
IEEE/ACM Transactions on Networking (TON)
Minimum diameter cost-constrained Steiner trees
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
We improve the complexity bound of the p-median problem on trees by showing that the total running time of the ''leaves to root'' dynamic programming algorithm is O(pn^2).