106 search results - page 18 / 22 » Approximating Spanning Trees with Inner Nodes Cost |
111
click to vote
ICDM
2010
IEEE
14 years 9 months ago
2010
IEEE
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
106
click to vote
SIGMOD
2011
ACM
14 years 2 months ago
2011
ACM
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—Upon the occurrence of a phenomenon of interest in a wireless sensor network, multiple sensors may be activated, leading to data implosion and redundancy. Data aggregation and/o...
121
click to vote
BROADNETS
2007
IEEE
15 years 6 months ago
2007
IEEE
— In this paper we deal with online broadcasting and multicasting in a WDM optical network with shared light splitter bank. Our objective is to maximize the network throughput. S...
SIAMCOMP
2008
14 years 11 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...