209 search results - page 7 / 42 » Computing a Diameter-Constrained Minimum Spanning Tree in Pa... |
143
Voted
HPCC
2007
Springer
15 years 9 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...
104
Voted
FOCS
1996
IEEE
15 years 7 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...
115
Voted
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
119
Voted
CSR
2008
Springer
15 years 3 months ago
2008
Springer
136
Voted
EOR
2006
15 years 3 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...