9 search results - page 1 / 2 » approx 2000 |
APPROX
2000
Springer
13 years 9 months ago
2000
Springer
APPROX
2000
Springer
13 years 9 months ago
2000
Springer
APPROX
2000
Springer
13 years 9 months ago
2000
Springer
We consider a fault tolerant version of the metric facility location problem in which every city, j, is required to be connected to rj facilities. We give the first non-trivial ap...
APPROX
2000
Springer
13 years 9 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
Goldreich (ECCC 2000) suggested a simple construction of a candidate one-way function f : {0, 1}n → {0, 1}m where each bit of output is a fixed predicate P of a constant number ...