628 search results - page 17 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
216
click to vote
DISOPT
2011
14 years 9 months ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
131
Voted
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
116
click to vote
EUROPAR
2004
Springer
15 years 7 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
146
click to vote
ISAAC
2009
Springer
15 years 9 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
106
click to vote
DIALM
2008
ACM
15 years 4 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...