Sciweavers

DAM
2006

Edge ranking of weighted trees

13 years 3 months ago
Edge ranking of weighted trees
: In this paper we consider the edge ranking problem of weighted trees. We prove that a special instance of this problem, namely edge ranking of multitrees is NP-hard already for multitrees with diameter at most 10. Note that the same problem but for trees is linearly solvable. We give an O(log n)-approximation polynomial time algorithm for edge ranking of weighted trees.
Dariusz Dereniowski
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where DAM
Authors Dariusz Dereniowski
Comments (0)