Sciweavers

1326 search results - page 51 / 266
» Approximate Tree Kernels
Sort
View
ISAAC
1993
Springer
106views Algorithms» more  ISAAC 1993»
15 years 6 months ago
Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem
Ulrich Fößmeier, Michael Kaufmann, Alex...
STOC
1994
ACM
97views Algorithms» more  STOC 1994»
15 years 6 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
APPROX
2006
Springer
110views Algorithms» more  APPROX 2006»
15 years 5 months ago
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees
Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad ...