Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Dynamic vs Oblivious Routing in Network Design   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 impact of different routing models in this robust setting:
in particular, we compare \emph{oblivious} routing, where the routing between
each terminal pair must be fixed in advance, to \emph{dynamic} routing, where
routings may depend arbitrarily on the current demand. Our main result is a
construction that shows that the optimal cost of such a network based on
oblivious routing (fractional or integral) may be a factor of
$\BigOmega(\log{n})$ more than the cost required when using dynamic routing.
This is true even in the important special case of the asymmetric hose model.
This answers a question in \cite{chekurisurvey07}, and is tight up to constant
factors. Our proof technique builds on a connection between expander graphs and
robust design for single-sink traffic patterns \cite{ChekuriHardness07}.

35
The categories of this paper are: mtrl-th
37
The categories of this paper are: supr-con
24
The categories of this paper are: dg-ga
31
The categories of this paper are: ao-sci
32
The categories of this paper are: atom-ph
22
The categories of this paper are: chao-dyn
21
The categories of this paper are: adap-org
4
The categories of this paper are: cond-mat
17
The categories of this paper are: q-fin
36
The categories of this paper are: cmp-lg
16
The categories of this paper are: stat
15
The categories of this paper are: nucl-ex
9
The categories of this paper are: nlin
11
The categories of this paper are: hep-lat
7
The categories of this paper are: hep-th
14
The categories of this paper are: math-ph