32 search results - page 3 / 7 » mst 2007 |
MSOM
2007
13 years 10 months ago
2007
GBRPR
2007
Springer
14 years 5 months ago
2007
Springer
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
TRECVID
2007
14 years 15 hour ago
2007
In this paper we describe our experiments for the high level features extraction task of TRECVid 2007. Our approach is different than previous submissions in that we have impleme...
FSTTCS
2007
Springer
14 years 5 months ago
2007
Springer
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b 2. The aim is to nd a minimum weight spannin...
OPODIS
2001
14 years 7 days ago
2001
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...