Sciweavers

279 search results - page 19 / 56
» Degree-bounded minimum spanning trees
Sort
View
185
Voted
SPAA
1998
ACM
15 years 11 months ago
Communication-Optimal Parallel Minimum Spanning Tree Algorithms (Extended Abstract)
Micah Adler, Wolfgang Dittrich, Ben H. H. Juurlink...
STOC
1994
ACM
97views Algorithms» more  STOC 1994»
15 years 11 months ago
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words...
Naveen Garg, Dorit S. Hochbaum
117
Voted
CCCG
2004
15 years 8 months ago
Degree-bounded minimum spanning trees
Raja Jothi, Balaji Raghavachari