arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1705.02752cs.DScs.CG
收藏

树中k-中心问题的$O(n\log n)$ -时间算法

An $O(n\log n)$-Time Algorithm for the k-Center Problem in Trees

Haitao Wang, Jingru Zhang

摘要:

我们考虑一个经典的k-中心问题的树。设T是一棵n个顶点的树,每个顶点都有非负权。问题是在T的边上找到k个中心,使得从所有顶点到其最近中心的最大加权距离最小。Megiddo和Tamir(SIAM J. Comput.,1983)给出了一个利用Cole参数搜索在$O(n\log^2 n)$时间内求解该问题的算法。从那时起,这个问题是否能在$O(n\log n)$时间内解决,已经开放了三十多年。本文给出了该问题的一个$O(n\log n)$时间算法,从而肯定地解决了该公开问题。

英文摘要:

We consider a classical k-center problem in trees. Let T be a tree of n vertices and every vertex has a nonnegative weight. The problem is to find k centers on the edges of T such that the maximum weighted distance from all vertices to their closest centers is minimized. Megiddo and Tamir (SIAM J. Comput., 1983) gave an algorithm that can solve the problem in $O(n\log^2 n)$ time by using Cole's parametric search. Since then it has been open for over three decades whether the problem can be solved in $O(n\log n)$ time. In this paper, we present an $O(n\log n)$ time algorithm for the problem and thus settle the open problem affirmatively.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑