A question about restricted shortest path computing

Hello everyone!

Does anybody happen to know any approximation algorithms
for computing the restricted shortest path in a directed
graph with negative cost weight and even negative cycle?
The restriction is that the total delay of the path should
be no more than a given value T and the delay of each edge
in the graph is non-negative.

Thank you for your attention.

--
Sincerely yours,

PENG, Chao


.

Quantcast