File Download
There are no files associated with this item.
SFX Link
- Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
- Vigneron, Antoine
- Geometric Algorithms Lab.
Views & Downloads
Detailed Information
Cited time in 
Cited time in 
Cited time in
Metadata Downloads
An algorithm for finding a k-median in a directed tree
- Author(s)
- Vigneron, A, Gao, LX, Golin, MJ, Italiano, GF, Li, B
- Issued Date
- 2000-04
- Citation
- INFORMATION PROCESSING LETTERS, v.74, no.1-2, pp.81 - 88
- Abstract
- We consider the problem of finding a k-median in a directed tree. We present an algorithm that computes a k-median in O(Pk(2)) time where k is the number of resources to be placed and P is the path length of the tree. In the case of a balanced tree, this implies O(k(2)n log n) time, in a random tree O(k(2)n(3/2)), while in the worst case O(k(2)n(2)). Our method employs dynamic programming and uses O(nk) space, while the best known algorithms for undirected trees require O(n(2)k) space. (C) 2000 Elsevier Science B.V. All rights reserved
- Publisher
- ELSEVIER SCIENCE BV
- ISSN
- 0020-0190
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.