%0 Journal Article %1 journals/siamcomp/Eppstein98 %A Eppstein, David %D 1998 %J SIAM J. Comput. %K computation path shortest %N 2 %P 652-673 %T Finding the k Shortest Paths. %U http://dblp.uni-trier.de/db/journals/siamcomp/siamcomp28.html#Eppstein98 %V 28

@article{journals/siamcomp/Eppstein98, added-at = {2018-11-14T15:20:39.000+0100}, author = {Eppstein, David}, biburl = {https://www.bibsonomy.org/bibtex/2e20558400717eda71b537d93a8be8e95/ans}, ee = {http://dx.doi.org/10.1137/S0097539795290477}, interhash = {c19a118409eebecc32e78cb38866544e}, intrahash = {e20558400717eda71b537d93a8be8e95}, journal = {SIAM J. Comput.}, keywords = {computation path shortest}, number = 2, pages = {652-673}, timestamp = {2018-11-14T15:20:39.000+0100}, title = {Finding the k Shortest Paths.}, url = {http://dblp.uni-trier.de/db/journals/siamcomp/siamcomp28.html#Eppstein98}, volume = 28, year = 1998 }