326 search results - page 23 / 66 » The Minimum-Area Spanning Tree Problem |
130
click to vote
ISITA
2010
14 years 11 months ago
2010
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...
104
click to vote
GD
2004
Springer
15 years 7 months ago
2004
Springer
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
122
click to vote
ISPD
2010
ACM
15 years 8 months ago
2010
ACM
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
128
click to vote
AINA
2007
IEEE
15 years 8 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
104
click to vote
JPDC
2006
15 years 1 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 ...