Randomized algorithms for finding the shortest negative cost cycle in networks by Orlin, James B, Subramani, K., Wojciechowki, Piotr

“…This problem will henceforth be referred to as the Shortest Negative Cost Cycle problem (SNCC). SNCC is closely related to the problem of checking whether a directed, weighted graph contains a negative cost cycle (NCCD). …”
Get full text