Sciweavers

4843 search results - page 51 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
CPM
1997
Springer
111views Combinatorics» more  CPM 1997»
14 years 29 days ago
Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem
Mary Cryan, Leslie Ann Goldberg, Cynthia A. Philli...
ISAAC
1993
Springer
106views Algorithms» more  ISAAC 1993»
14 years 26 days ago
Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem
Ulrich Fößmeier, Michael Kaufmann, Alex...
STOC
1994
ACM
97views Algorithms» more  STOC 1994»
14 years 26 days 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