R. Sai Anand, Thomas Erlebach. On-line Algorithms for Edge-Disjoint Paths in Trees of Rings. In Sergio Rajsbaum, editor, LATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Cancun, Mexico, April 3-6, 2002, Proceedings. Volume 2286 of Lecture Notes in Computer Science, pages 584-597, Springer, 2002. [doi]
@inproceedings{AnandE02,
title = {On-line Algorithms for Edge-Disjoint Paths in Trees of Rings},
author = {R. Sai Anand and Thomas Erlebach},
year = {2002},
url = {http://link.springer.de/link/service/series/0558/bibs/2286/22860584.htm},
researchr = {https://researchr.org/publication/AnandE02},
cites = {0},
citedby = {0},
pages = {584-597},
booktitle = {LATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Cancun, Mexico, April 3-6, 2002, Proceedings},
editor = {Sergio Rajsbaum},
volume = {2286},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-43400-3},
}