Sciweavers

230 search results - page 6 / 46
» Minimum Spanning Tree Problem with Label Selection
Sort
View
STOC
1994
ACM
97views Algorithms» more  STOC 1994»
13 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
ENDM
2008
85views more  ENDM 2008»
13 years 7 months ago
Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem
Thiago F. Noronha, Andréa C. Santos, Celso ...