ESA
2001
Springer
13 years 9 months ago
2001
Springer
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...
ESA
2001
Springer
13 years 9 months ago
2001
Springer
ESA
2001
Springer
13 years 9 months ago
2001
Springer
ESA
2001
Springer
13 years 9 months ago
2001
Springer
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...
ESA
2001
Springer
13 years 9 months ago
2001
Springer
ESA
2001
Springer
13 years 9 months ago
2001
Springer
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 ...
ESA
2001
Springer
13 years 9 months ago
2001
Springer
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...
ESA
2001
Springer
13 years 9 months ago
2001
Springer
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...
ESA
2001
Springer
13 years 9 months ago
2001
Springer
ESA
2001
Springer
13 years 9 months ago
2001
Springer
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...