Hybrid Demand Oblivious Routing: Hyper-cubic Partitions and Theoretical Upper Bounds

Gábor Németh, Gábor Rétvári. Hybrid Demand Oblivious Routing: Hyper-cubic Partitions and Theoretical Upper Bounds. In Ioannis Tomkos, Christos Bouras, Georgios Ellinas, Panagiotis Demestichas, Prasun Sinha, editors, Broadband Communications, Networks, and Systems - 7th International ICST Conference, BROADNETS 2010, Athens, Greece, October 25-27, 2010, Revised Selected Papers. Volume 66 of Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, pages 84-100, Springer, 2010. [doi]

@inproceedings{NemethR10,
  title = {Hybrid Demand Oblivious Routing: Hyper-cubic Partitions and Theoretical Upper Bounds},
  author = {Gábor Németh and Gábor Rétvári},
  year = {2010},
  doi = {10.1007/978-3-642-30376-0_7},
  url = {http://dx.doi.org/10.1007/978-3-642-30376-0_7},
  researchr = {https://researchr.org/publication/NemethR10},
  cites = {0},
  citedby = {0},
  pages = {84-100},
  booktitle = {Broadband Communications, Networks, and Systems - 7th International ICST Conference, BROADNETS 2010, Athens, Greece, October 25-27, 2010, Revised Selected Papers},
  editor = {Ioannis Tomkos and Christos Bouras and Georgios Ellinas and Panagiotis Demestichas and Prasun Sinha},
  volume = {66},
  series = {Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering},
  publisher = {Springer},
  isbn = {978-3-642-30375-3},
}