Sciweavers

SODA
2007
ACM
131views Algorithms» more  SODA 2007»
13 years 6 months ago
On the K-simple shortest paths problem in weighted directed graphs
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
Liam Roditty