45 search results - page 1 / 9 » Oblivious routing in directed graphs with random demands |
83
Voted
STOC
2005
ACM
16 years 4 days ago
2005
ACM
113
click to vote
SPAA
2006
ACM
15 years 5 months ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
89
Voted
SPAA
2003
ACM
15 years 5 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
SPAA
2005
ACM
15 years 5 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
103
click to vote
ESA
2009
Springer
15 years 6 months ago
2009
Springer
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...