59 search results - page 11 / 12 » soda 2003 |
SODA
2003
ACM
13 years 6 months ago
2003
ACM
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...
SODA
2003
ACM
13 years 6 months ago
2003
ACM
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...
SODA
2003
ACM
13 years 6 months ago
2003
ACM
In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream Ä ¾ Ñ Ò using two passes and Ç´¯ ½ ÔÒÐÓ Ò´ÐÓ Ñ·ÐÓ...
SODA
2003
ACM
13 years 6 months ago
2003
ACM
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...
SODA
2003
ACM
13 years 6 months ago
2003
ACM
Collusion-secure fingerprinting codes are an important primitive used by many digital watermarking schemes [1, 10, 9]. Boneh and Shaw [3] define a model for these types of codes...