Ehab Morsy, Hiroshi Nagamochi. Approximating the Generalized Capacitated Tree-Routing Problem. In Xiaodong Hu, Jie Wang, editors, Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings. Volume 5092 of Lecture Notes in Computer Science, pages 621-630, Springer, 2008. [doi]
@inproceedings{MorsyN08:0,
title = {Approximating the Generalized Capacitated Tree-Routing Problem},
author = {Ehab Morsy and Hiroshi Nagamochi},
year = {2008},
doi = {10.1007/978-3-540-69733-6_61},
url = {http://dx.doi.org/10.1007/978-3-540-69733-6_61},
tags = {routing},
researchr = {https://researchr.org/publication/MorsyN08%3A0},
cites = {0},
citedby = {0},
pages = {621-630},
booktitle = {Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings},
editor = {Xiaodong Hu and Jie Wang},
volume = {5092},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-69732-9},
}