Sciweavers

ESA
2005
Springer
146views Algorithms» more  ESA 2005»
15 years 10 months ago
An Approximation Algorithm for the Minimum Latency Set Cover Problem
The input to the minimum latency set cover problem (MLSC) consists of a set of jobs and a set of tools. Each job j needs a specific subset Sj of the tools in order to be processed...
Refael Hassin, Asaf Levin
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
15 years 10 months ago
An Algorithm for Node-Capacitated Ring Routing
András Frank, Zoltán Király, ...
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
15 years 10 months ago
Online Occlusion Culling
Abstract. Modern computer graphics systems are able to render sophisticated 3D scenes consisting of millions of polygons. For most camera positions only a small collection of these...
Gereon Frahling, Jens Krokowski
ESA
2005
Springer
77views Algorithms» more  ESA 2005»
15 years 10 months ago
Designing Reliable Algorithms in Unreliable Memories
Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Ita...
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
15 years 10 months ago
Making Chord Robust to Byzantine Attacks
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...
Amos Fiat, Jared Saia, Maxwell Young
ESA
2005
Springer
161views Algorithms» more  ESA 2005»
15 years 10 months ago
Cache-Oblivious Comparison-Based Algorithms on Multisets
Abstract. We study three comparison-based problems related to multisets in the cache-oblivious model: Duplicate elimination, multisorting and finding the most frequent element (th...
Arash Farzan, Paolo Ferragina, Gianni Franceschini...
ESA
2005
Springer
89views Algorithms» more  ESA 2005»
15 years 10 months ago
Experimental Study of Geometric t-Spanners
Abstract. The construction of t-spanners of a given point set has received a lot of attention, especially from a theoretical perspective. In this paper we perform the first extens...
Mohammad Farshi, Joachim Gudmundsson
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
15 years 10 months ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
15 years 10 months ago
Online Bin Packing with Cardinality Constraints
We consider a one dimensional storage system where each container can store a bounded amount of capacity as well as a bounded number of items k ≥ 2. This defines the (standard)...
Leah Epstein
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
15 years 10 months ago
: Standard Template Library for XXL Data Sets
Abstract. We present a software library Stxxl, that enables practiceoriented experimentation with huge data sets. Stxxl is an implementation of the C++ standard template library ST...
Roman Dementiev, Lutz Kettner, Peter Sanders