628 search results - page 86 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
152
click to vote
INFOCOM
2010
IEEE
15 years 29 days ago
2010
IEEE
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
132
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
This paper studies the “explanation problem” for tree- and linearly-ordered array data, a problem motivated by database applications and recently solved for the one-dimensiona...
140
click to vote
SIAMCOMP
2000
15 years 2 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
133
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
121
click to vote
SMI
2005
IEEE
15 years 8 months ago
2005
IEEE
For time-dependent scalar fields, one is often interested in topology changes of contours in time. In this paper, we focus on describing how contours split and merge over a certa...