Sciweavers

ESA
2006
Springer
130views Algorithms» more  ESA 2006»
13 years 8 months ago
Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces
Lower envelopes are fundamental structures in computational geometry, which have many applications, such as computing general Voronoi diagrams and performing hidden surface removal...
Michal Meyerovitch
ESA
2006
Springer
103views Algorithms» more  ESA 2006»
13 years 8 months ago
Greedy in Approximation Algorithms
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
Julián Mestre
ESA
2006
Springer
136views Algorithms» more  ESA 2006»
13 years 8 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»
13 years 8 months ago
Popular Matchings in the Capacitated House Allocation Problem
David Manlove, Colin T. S. Sng
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
13 years 8 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»
13 years 8 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»
13 years 8 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
ESA
2006
Springer
112views Algorithms» more  ESA 2006»
13 years 8 months ago
Enumerating Spanning and Connected Subsets in Graphs and Matroids
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...
Leonid Khachiyan, Endre Boros, Konrad Borys, Khale...
ESA
2006
Springer
207views Algorithms» more  ESA 2006»
13 years 8 months ago
Cheating by Men in the Gale-Shapley Stable Matching Algorithm
Abstract. This paper addresses strategies for the stable marriage problem. For the Gale-Shapley algorithm with men proposing, a classical theorem states that it is impossible for e...
Chien-Chung Huang