Sciweavers

ESA
2006
Springer
136views Algorithms» more  ESA 2006»
15 years 6 months ago
Approximation in Preemptive Stochastic Online Scheduling
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
Nicole Megow, Tjark Vredeveld
ESA
2006
Springer
194views Algorithms» more  ESA 2006»
15 years 6 months ago
Popular Matchings in the Capacitated House Allocation Problem
David Manlove, Colin T. S. Sng
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
15 years 6 months ago
Navigating Low-Dimensional and Hierarchical Population Networks
Abstract. Social networks are navigable small worlds, in which two arbitrary people are likely connected by a short path of intermediate friends that can be found by a "decent...
Ravi Kumar, David Liben-Nowell, Andrew Tomkins
ESA
2006
Springer
134views Algorithms» more  ESA 2006»
15 years 6 months ago
A Unified Approach to Approximating Partial Covering Problems
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
Jochen Könemann, Ojas Parekh, Danny Segev
ESA
2006
Springer
106views Algorithms» more  ESA 2006»
15 years 6 months ago
Less Hashing, Same Performance: Building a Better Bloom Filter
A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash functions of the form gi(x) = h1(x) + ih2(x). We demonstra...
Adam Kirsch, Michael Mitzenmacher