Approximability of unsplittable shortest path routing problems

Networks ◽  
2009 ◽  
Vol 54 (1) ◽  
pp. 23-46 ◽  
Author(s):  
Andreas Bley
Sign in / Sign up

Export Citation Format

Share Document