Sciweavers

Share
SODA
2004
ACM
146views Algorithms» more  SODA 2004»
10 years 1 months ago
Approximating the two-level facility location problem via a quasi-greedy approach
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
Jiawei Zhang
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
10 years 1 months ago
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
Kevin C. Zatloukal, Nicholas J. A. Harvey
SODA
2004
ACM
87views Algorithms» more  SODA 2004»
10 years 1 months ago
Optimal space lower bounds for all frequency moments
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
David P. Woodruff
SODA
2004
ACM
161views Algorithms» more  SODA 2004»
10 years 1 months ago
Approximation schemes for Metric Bisection and partitioning
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...
SODA
2004
ACM
173views Algorithms» more  SODA 2004»
10 years 1 months ago
Tabulation based 4-universal hashing with applications to second moment estimation
We show that 4-universal hashing can be implemented efficiently using tabulated 4-universal hashing for characters, gaining a factor of 5 in speed over the fastest existing method...
Mikkel Thorup, Yin Zhang
SODA
2004
ACM
92views Algorithms» more  SODA 2004»
10 years 1 months ago
Facility location with Service Installation Costs
David B. Shmoys, Chaitanya Swamy, Retsef Levi
SODA
2004
ACM
151views Algorithms» more  SODA 2004»
10 years 1 months ago
Minimum moment Steiner trees
For a rectilinear Steiner tree T with a root, define its k-th moment Mk(T) = T (dT (u))k du, where the integration is over all edges of T, dT (u) is the length of the unique path ...
Wangqi Qiu, Weiping Shi
SODA
2004
ACM
95views Algorithms» more  SODA 2004»
10 years 1 months ago
Buffer minimization using max-coloring
Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varad...
SODA
2004
ACM
118views Algorithms» more  SODA 2004»
10 years 1 months ago
The maximum latency of selfish routing
We give several new upper and lower bounds on the worst-case severity of Braess's Paradox and the price of anarchy of selfish routing with respect to the maximum latency obje...
Tim Roughgarden
books