TU Berlin

Prof. Dr. Andreas BleyPublications

Page Content

to Navigation


On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem
Citation key Bley2005b
Author Bley, Andreas
Title of Book Integer Programming and Combinatorial Optimization: Proceedings of the 11th Conference on Integer Programming and Combinatorial Optimization (IPCO 2005), Berlin, Germany
Pages 97–110
Year 2005
Number 3509
Publisher Springer
Series LNCS
Download Bibtex entry


Quick Access

Schnellnavigation zur Seite über Nummerneingabe