1. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
2. Efficient computation of delay-sensitive routes from one source to all destinations;Goel,2001
3. Approximation schemes for the restricted shortest path problems;Hassin;Math. Oper. Res.,1992
4. The network inhibition problem;Phillips,1993
5. Simple efficient approximation scheme for the restricted shortest path problem, Technical Report 10009674-991214-04TM;Raz,1999