default search action
"Approximability of unsplittable shortest path routing problems."
Andreas Bley (2009)
- Andreas Bley:
Approximability of unsplittable shortest path routing problems. Networks 54(1): 23-46 (2009)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.