On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem.

Andreas Bley

Browse the full IPCO paper archive.