Sciweavers

365 search results - page 9 / 73
» On the Crossing Spanning Tree Problem
Sort
View
STOC
1994
ACM
97views Algorithms» more  STOC 1994»
15 years 7 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
106
Voted
COLOGNETWENTE
2008
15 years 5 months ago
Heuristic and exact approaches to the Quadratic Minimum Spanning Tree Problem
Roberto Cordone, Gianluca Passeri
76
Voted
EOR
2010
55views more  EOR 2010»
15 years 3 months ago
Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms
Gustavo Bergantiños, Juan J. Vidal-Puga