628 search results - page 28 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
133
click to vote
DCOSS
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
101
click to vote
COCOA
2008
Springer
15 years 4 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
184
Voted
INFOCOM
2012
IEEE
13 years 5 months ago
2012
IEEE
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
132
Voted
CIAC
2010
Springer
15 years 12 months ago
2010
Springer
In this paper we consider a natural generalization of the well-known Max Leaf
Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as
input an undirected co...
129
Voted
FOCS
1992
IEEE
15 years 6 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...