666 search results - page 39 / 134 » New primal-dual algorithms for Steiner tree problems |
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
ICAISC
2010
Springer
14 years 2 months ago
2010
Springer
In the paper a new evolutionary algorithm for induction of univariate regression trees is proposed. In contrast to typical top-down approaches it globally searches for the best tre...
WDAG
2009
Springer
14 years 3 months ago
2009
Springer
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
WADS
2009
Springer
14 years 3 months ago
2009
Springer
Locked tree linkages have been known to exist in the plane since 1998, but it is still open whether they have a polynomial-time characterization. This paper examines the properties...
SPAA
2006
ACM
14 years 3 months ago
2006
ACM
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...