APPROX
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm t...
APPROX
2007
Springer
14 years 5 months ago
2007
Springer
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
APPROX
2007
Springer
14 years 5 months ago
2007
Springer
APPROX
2007
Springer
14 years 5 months ago
2007
Springer
APPROX
2007
Springer
14 years 5 months ago
2007
Springer
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
APPROX
2007
Springer
14 years 5 months ago
2007
Springer
abstract Manor Mendel1 and Assaf Naor2 1 The Open University of Israel 2 Courant Institute Let (X, dX ) be an n-point metric space. We show that there exists a distribution D over ...
APPROX
2007
Springer
14 years 5 months ago
2007
Springer
APPROX
2007
Springer
14 years 5 months ago
2007
Springer
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
APPROX
2007
Springer
14 years 5 months ago
2007
Springer
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
APPROX
2007
Springer
14 years 5 months ago
2007
Springer
We consider the problem of derandomizing random walks in the Euclidean space Rk . We show that for k = 2, and in some cases in higher dimensions, such walks can be simulated in Lo...