105 search results - page 2 / 21 » A 3-Approximation for the Minimum Tree Spanning k Vertices |
103
click to vote
IWPEC
2009
Springer
15 years 5 months ago
2009
Springer
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
STOC
1994
ACM
15 years 3 months ago
1994
ACM
Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words...
105
Voted
NETWORKS
2010
14 years 9 months ago
2010
We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
COMPGEOM
2003
ACM
15 years 4 months ago
2003
ACM
Let τK be the worst-case (supremum) ratio of the weight of the minimum degree-K spanning tree to the weight of the minimum spanning tree, over all finite point sets in the Eu