28 search results - page 3 / 6 » wea 2005 |
WEA
2005
Springer
14 years 4 months ago
2005
Springer
WEA
2005
Springer
14 years 4 months ago
2005
Springer
We propose a novel algorithm based on random graphs to construct minimal perfect hash functions h. For a set of n keys, our algorithm outputs h in expected time O(n). The evaluatio...
WEA
2005
Springer
14 years 4 months ago
2005
Springer
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
WEA
2005
Springer
14 years 4 months ago
2005
Springer
We consider the problem of finding a door along a wall with a blind robot that neither knows the distance to the door nor the direction towards of the door. This problem can be so...
WEA
2005
Springer
14 years 4 months ago
2005
Springer
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...