209 search results - page 7 / 42 » Computing a Diameter-Constrained Minimum Spanning Tree in Pa... |
HPCC
2007
Springer
15 years 3 months ago
2007
Springer
Clustering of data has numerous applications and has been studied extensively. It is very important in Bioinformatics and data mining. Though many parallel algorithms have been des...
FOCS
1996
IEEE
15 years 1 months ago
1996
IEEE
In thispaper we give a 3-approximationalgorithmfor the problem ojJnding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximationalgorithmfor t...
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
CSR
2008
Springer
14 years 9 months ago
2008
Springer
EOR
2006
14 years 9 months ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...