166 search results - page 14 / 34 » A fast distributed approximation algorithm for minimum spann... |
120
Voted
WDAG
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
122
Voted
FOCS
2009
IEEE
15 years 9 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
116
Voted
PDPTA
2003
15 years 4 months ago
2003
We investigate the management of flocking mobile objects using a parallel message-passing computer cluster. An octree, a data structure well-known for use in managing a 3D space, ...
141
Voted
APPROX
2007
Springer
15 years 8 months ago
2007
Springer
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
151
Voted
MOBIHOC
2002
ACM
16 years 2 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...