You are not currently logged in.
Access JSTOR through your library or other institution:
Approximation Schemes for the Restricted Shortest Path Problem
Mathematics of Operations Research
Vol. 17, No. 1 (Feb., 1992), pp. 36-42
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/3689891
Page Count: 7
Preview not available
This note contains two fully polynomial approximation schemes for the shortest path problem with an additional constraint. The main difficulty in constructing such algorithms arises since no trivial lower and upper bounds on the solution value, whose ratio is polynomially bounded, are known. In spite of this difficulty, one of the algorithms presented here is strongly polynomial. Applications to other problems are also discussed.
Mathematics of Operations Research © 1992 INFORMS