36 search results - page 2 / 8 » Improved Approximation Algorithms for the Spanning Star Fore... |
JPDC
2006
13 years 5 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 ...
SIAMDM
2008
13 years 5 months ago
2008
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
COLT
2010
Springer
13 years 3 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
EUROCAST
2007
Springer
13 years 11 months ago
2007
Springer
After the detection of the first extrasolar planet (exoplanet) more than one decade ago we currently know about more than 200 planets around other stars and there are about twenty...
SAC
2003
ACM
13 years 10 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...