Andreas Bley. On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem. In Michael Jünger, Volker Kaibel, editors, Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings. Volume 3509 of Lecture Notes in Computer Science, pages 97-110, Springer, 2005. [doi]
@inproceedings{Bley05,
title = {On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem},
author = {Andreas Bley},
year = {2005},
doi = {10.1007/11496915_8},
url = {http://dx.doi.org/10.1007/11496915_8},
tags = {routing},
researchr = {https://researchr.org/publication/Bley05},
cites = {0},
citedby = {0},
pages = {97-110},
booktitle = {Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings},
editor = {Michael Jünger and Volker Kaibel},
volume = {3509},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-26199-0},
}