328 search results - page 40 / 66 » An O(log n log log n) space algorithm for undirected st-conn... |
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...
ALGORITHMICA
2008
13 years 7 months ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...