628 search results - page 11 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
115
click to vote
JUCS
2007
14 years 11 months ago
2007
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
105
click to vote
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
STACS
2001
Springer
15 years 4 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
100
click to vote
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
SODA
2003
ACM
15 years 1 months ago
2003
ACM
