A new template for solving p-Median problems for trees in sub-quadratic time

被引：0
|
作者：
Benkoczi, R [1 ]
Bhattacharya, B
机构：
[1] Queens Univ, Sch Comp, Kingston, ON K7L 3N6, Canada
[2] Simon Fraser Univ, Sch Comp Sci, Burnaby, BC V5A 1S6, Canada
来源：
ALGORITHMS - ESA 2005 | 2005年 / 3669卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We propose an O(n log(p+2) n) 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.
引用
收藏
页码：271 / 282
页数：12
相关论文
共 50 条
12345