Yossi Azar, Uriel Feige, Daniel Glasner. A Preemptive Algorithm for Maximizing Disjoint Paths on Trees. In Joachim Gudmundsson, editor, Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings. Volume 5124 of Lecture Notes in Computer Science, pages 319-330, Springer, 2008. [doi]
@inproceedings{AzarFG08,
title = {A Preemptive Algorithm for Maximizing Disjoint Paths on Trees},
author = {Yossi Azar and Uriel Feige and Daniel Glasner},
year = {2008},
doi = {10.1007/978-3-540-69903-3_29},
url = {http://dx.doi.org/10.1007/978-3-540-69903-3_29},
researchr = {https://researchr.org/publication/AzarFG08},
cites = {0},
citedby = {0},
pages = {319-330},
booktitle = {Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
editor = {Joachim Gudmundsson},
volume = {5124},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-69900-2},
}