We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vectors in some highâ€¦ (More)

It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This improves upon theâ€¦ (More)

We consider the ploying all optica P roblem of routing in networks emrouting technology. In these networks, messages travel in optical form and switchin is f! erformed directly on the optical signal.â€¦ (More)

We deal with the competitive analysis of algorithms for managing data in a distributed environment. We deal with the file allocation problem ([DF], [ML]), where copies of a file may be be stored inâ€¦ (More)

We show that the Multicut, Sparsest-Cut, and Min-2CNFÂ â‰¡Â Deletion problems are NP-hard to approximate within every constant factor, assuming the Unique Games Conjecture of Khot (2002). Aâ€¦ (More)

We develop a general technique for the quantitative analysis of iterative distributed load balancing schemes. We illustrate the technique by studying two simple, intuitively appealing models that areâ€¦ (More)

In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semi-metric on the set of terminals. Our goal is to assign the rest of the nodes to terminals so asâ€¦ (More)