166 search results - page 5 / 34 » A fast distributed approximation algorithm for minimum spann... |
STOC
2007
ACM
14 years 7 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
WDAG
2007
Springer
14 years 24 days ago
2007
Springer
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
SODA
1998
ACM
13 years 8 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
SPAA
1998
ACM
13 years 11 months ago
1998
ACM
IJKESDP
2010
13 years 5 months ago
2010
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...