Approximating Capacitated Tree-Routings in Networks

Ehab Morsy, Hiroshi Nagamochi. Approximating Capacitated Tree-Routings in Networks. In Jin-yi Cai, S. Barry Cooper, Hong Zhu, editors, Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings. Volume 4484 of Lecture Notes in Computer Science, pages 342-353, Springer, 2007. [doi]

@inproceedings{MorsyN07:1,
  title = {Approximating Capacitated Tree-Routings in Networks},
  author = {Ehab Morsy and Hiroshi Nagamochi},
  year = {2007},
  doi = {10.1007/978-3-540-72504-6_31},
  url = {http://dx.doi.org/10.1007/978-3-540-72504-6_31},
  tags = {routing},
  researchr = {https://researchr.org/publication/MorsyN07%3A1},
  cites = {0},
  citedby = {0},
  pages = {342-353},
  booktitle = {Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings},
  editor = {Jin-yi Cai and S. Barry Cooper and Hong Zhu},
  volume = {4484},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-72503-9},
}