628 search results - page 77 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
154
click to vote
CIAC
1994
Springer
15 years 7 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
124
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
145
click to vote
SIGMOD
2011
ACM
14 years 5 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...
137
click to vote
ESA
2008
Springer
15 years 4 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
145
click to vote
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...