Hasna Mohsen Alqahtani, Thomas Erlebach. Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width. In Zsuzsanna Lipták, William F. Smyth, editors, Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers. Volume 9538 of Lecture Notes in Computer Science, pages 13-24, Springer, 2015. [doi]
@inproceedings{AlqahtaniE15-0,
title = {Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width},
author = {Hasna Mohsen Alqahtani and Thomas Erlebach},
year = {2015},
doi = {10.1007/978-3-319-29516-9_2},
url = {http://dx.doi.org/10.1007/978-3-319-29516-9_2},
researchr = {https://researchr.org/publication/AlqahtaniE15-0},
cites = {0},
citedby = {0},
pages = {13-24},
booktitle = {Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers},
editor = {Zsuzsanna Lipták and William F. Smyth},
volume = {9538},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-29515-2},
}