240 search results - page 20 / 48 » Forest for the trees |
STOC
2010
ACM
14 years 2 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
DAGSTUHL
2007
13 years 11 months ago
2007
The automation of forest cleaning presupposes principles for choosing those trees that ought to be taken away and those that shall be left standing. In this paper, which is a repor...
IPPS
1998
IEEE
14 years 2 months ago
1998
IEEE
We present a rst randomized Ologk n time and On+m work CRCWPRAM algorithm for nding a spanning forest of an undirected dense graph with n vertices. Furthermore we construct a rando...
BMCBI
2010
13 years 10 months ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
JPDC
2006
13 years 9 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...