4 search results - page 1 / 1 » Narrow-Shallow-Low-Light Trees with and without Steiner Poin... |
ESA
2009
Springer
13 years 11 months ago
2009
Springer
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
A rectilinear Steiner arborescence (RSA) is a tree, whose nodes include a prescribed set of points, termed the vertices, in the first quadrant of the Cartesian plane, and whose tr...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...