628 search results - page 30 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
CIAC
2006
Springer
15 years 6 months ago
2006
Springer
156
click to vote
SODA
2010
ACM
15 years 12 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
121
Voted
ASIAMS
2007
IEEE
15 years 9 months ago
2007
IEEE
The tree structure has received much interest as a versatile architecture for a large class of parallel processing applications. Spanning trees in particular are essential tools f...
129
Voted
WINET
2010
15 years 28 days ago
2010
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
137
Voted
LATIN
2010
Springer
15 years 9 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...