A simple efficient approximation scheme for the restricted shortest path problem
Top Cited Papers
- 1 June 2001
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 28 (5) , 213-219
- https://doi.org/10.1016/s0167-6377(01)00069-4
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Optimal partition of QoS requirements with discrete cost functionsIEEE Journal on Selected Areas in Communications, 2000
- QoS routing in networks with uncertain parametersIEEE/ACM Transactions on Networking, 1998
- Errata and comments on “Approximation algorithms for the capacitated plant allocation problem”Operations Research Letters, 1996
- The network inhibition problemPublished by Association for Computing Machinery (ACM) ,1993
- Approximation Schemes for the Restricted Shortest Path ProblemMathematics of Operations Research, 1992
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path ProblemsOperations Research, 1987