@inproceedings{3f21d5babfc4454db5545fe56ca375c7,

title = "Shortest path feasibility algorithms: An experimental evaluation",

abstract = "This is an experimental study of algorithms for the shortest path feasibility problem: Given a directed weighted graph, find a negative cycle or present a short proof that none exists. We study previously known and new algorithms. Our testbed is more extensive than those previously used, including both static and incremental problems, as well as worst-case instances. We show that, while no single algorithm dominates, a small subset (including a new algorithm) has very robust performance in practice. Our work advances state of the art in the area.",

author = "Cherkassky, {Boris V.} and Loukas Georgiadis and Goldberg, {Andrew V.} and Tarjan, {Robert E.} and Werneck, {Renato F.}",

year = "2008",

doi = "10.1137/1.9781611972887.12",

language = "English (US)",

isbn = "9780898716535",

series = "Proceedings of the 10th Workshop on Algorithm Engineering and Experiments and the 5th Workshop on Analytic Algorithmics and Combinatorics",

publisher = "Cambridge University Press",

pages = "118--132",

booktitle = "Proceedings of the 10th Workshop on Algorithm Engineering and Experiments and the 5th Workshop on Analytic Algorithmics and Combinatorics",

address = "United Kingdom",

note = "10th Workshop on Algorithm Engineering and Experiments, ALENEX'08 and 5th Workshop on Analytic Algorithmics and Combinatorics, ANALCO'08 ; Conference date: 19-01-2008 Through 19-01-2008",

}