SIAMDM
2002
13 years 11 months ago
2002
Let T be an edge-weighted tree. A p-core of T is a set of p mutually disjoint paths in T that minimizes the sum of the distances of all vertices in T from any of the p paths, where...
HICSS
2008
IEEE
13 years 11 months ago
2008
IEEE
Given an edge-weighted tree T, a k-trunk is a subtree Tk with k leaves in T which minimizes the sum of the distances of all vertices in T from Tk plus the weight of Tk. In this pa...
APPROX
2006
Springer
14 years 3 months ago
2006
Springer
Gupta (SODA'01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edg...
FUN
2007
Springer
14 years 5 months ago
2007
Springer
We analyse transports between leaves in an edge-weighted tree. We prove under which conditions there exists a transport matching the weights of a given tree. We use this to compute...