628 search results - page 20 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
107
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
119
click to vote
IFIP
2004
Springer
15 years 7 months ago
2004
Springer
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this proble...
141
click to vote
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
116
Voted
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
141
Voted
OPODIS
2001
15 years 3 months ago
2001
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...