@inproceedings{azar2003optimal,
  title={Optimal oblivious routing in polynomial time},
  author={Azar, Yossi and Cohen, Edith and Fiat, Amos and Kaplan, Haim and R{\"a}cke, Harald},
  booktitle={Proceedings of the thirty-fifth annual ACM symposium on Theory of computing},
  pages={383--388},
  year={2003},
  organization={ACM}
}

@inproceedings{bienkowski2003practical,
  title={A practical algorithm for constructing oblivious routing schemes},
  author={Bienkowski, Marcin and Korzeniowski, Miroslaw and R{\"a}cke, Harald},
  booktitle={Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures},
  pages={24--33},
  year={2003},
  organization={ACM}
}

@inproceedings{racke2008optimal,
  title={Optimal hierarchical decompositions for congestion minimization in networks},
  author={R{\"a}cke, Harald},
  booktitle={Proceedings of the fortieth annual ACM symposium on Theory of computing},
  pages={255--264},
  year={2008},
  organization={ACM}
}

@book{approx,
  title={The design of approximation algorithms},
  author={Williamson, David P and Shmoys, David B},
  year={2011},
  publisher={Cambridge University Press},
  pages={376--385}
}

@book{intro,
  added-at = {2012-02-12T20:02:28.000+0100},
  author = {Cormen, Thomas H. and Leiserson, Charles E. and Rivest, Ronald L. and Stein, Clifford},
  biburl = {http://www.bibsonomy.org/bibtex/2225d42638921bee01b4ac8ff991b0a6a/pvortex3},
  edition = 2,
  interhash = {dcdeb0ec50a6798abf1724056982b543},
  intrahash = {225d42638921bee01b4ac8ff991b0a6a},
  keywords = {},
  publisher = {The MIT Press},
  title = {Introduction to Algorithms},
  year = 2001
}