630 search results - page 36 / 126 » Hardness results for approximating the bandwidth |
STOC
2006
ACM
16 years 25 days ago
2006
ACM
In this paper, we present a simple distributed algorithm for resource allocation which simultaneously approximates the optimum value for a large class of objective functions. In p...
138
click to vote
CORR
2012
Springer
13 years 8 months ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
167
Voted
SSD
2009
Springer
15 years 7 months ago
2009
Springer
The range nearest-neighbor (NN) query is an important query type in location-based services, as it can be applied to the case that an NN query has a spatial region, instead of a lo...
103
Voted
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
—The paper addresses the problem of massive content distribution in the network where multiple sessions coexist. In the traditional approaches, the sessions form separate overlay...
77
Voted
SIGECOM
2005
ACM
15 years 6 months ago
2005
ACM
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...