Sciweavers

277 search results - page 17 / 56
» The saga of minimum spanning trees
Sort
View
ICALP
1997
Springer
15 years 10 months ago
Maintaining Minimum Spanning Trees in Dynamic Graphs
Monika Rauch Henzinger, Valerie King
STOC
1994
ACM
97views Algorithms» more  STOC 1994»
15 years 10 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
CCCG
2004
15 years 7 months ago
Degree-bounded minimum spanning trees
Raja Jothi, Balaji Raghavachari