Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
12 years 6 months ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito
ESA
2001
Springer
91views Algorithms» more  ESA 2001»
12 years 6 months ago
Lossy Dictionaries
Rasmus Pagh, Flemming Friche Rodler
ESA
2001
Springer
85views Algorithms» more  ESA 2001»
12 years 6 months ago
Cuckoo Hashing
Rasmus Pagh, Flemming Friche Rodler
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
12 years 6 months ago
SNPs Problems, Complexity, and Algorithms
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross...
ESA
2001
Springer
67views Algorithms» more  ESA 2001»
12 years 6 months ago
Online Bin Coloring
Sven Oliver Krumke, Willem de Paepe, Jörg Ram...
ESA
2001
Springer
75views Algorithms» more  ESA 2001»
12 years 6 months ago
Strongly Competitive Algorithms for Caching with Pipelined Prefetching
Suppose that a program makes a sequence of m accesses (references) to data blocks, the cache can hold k < m blocks, an access to a block in the cache incurs one time unit, and ...
Alexander Gaysinsky, Alon Itai, Hadas Shachnai
ESA
2001
Springer
145views Algorithms» more  ESA 2001»
12 years 6 months ago
Grouping Techniques for Scheduling Problems: Simpler and Faster
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastroli...
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
12 years 6 months ago
On the Parameterized Complexity of Layered Graph Drawing
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
Vida Dujmovic, Michael R. Fellows, Michael T. Hall...
ESA
2001
Springer
68views Algorithms» more  ESA 2001»
12 years 6 months ago
Property Testing with Geometric Queries
Artur Czumaj, Christian Sohler
ESA
2001
Springer
110views Algorithms» more  ESA 2001»
12 years 6 months ago
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks
We study the completion time of broadcast operations on static ad hoc wireless networks in presence of unpredictable and dynamical faults. Concerning oblivious fault-tolerant dist...
Andrea E. F. Clementi, Angelo Monti, Riccardo Silv...
books