628 search results - page 18 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
125
click to vote
PPSN
2010
Springer
15 years 27 days ago
2010
Springer
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
100
Voted
JACM
2000
15 years 2 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
117
click to vote
ICALP
2000
Springer
15 years 6 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
109
Voted
STOC
2005
ACM
16 years 2 months ago
2005
ACM
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
126
Voted
STOC
2004
ACM
16 years 2 months ago
2004
ACM
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...