Negative-cycle detection algorithms (1999) [32 citations — 3 self]
Download:
|
|
by Boris V. Cherkassky, Krasikova St, Andrew V. Goldberg
Mathematical Programming
http://www.avglab.com/andrew/./pub/neci-tr-96-029.ps
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Cherkassky99negative-cycledetection,author = {Boris V. Cherkassky and Krasikova St and Andrew V. Goldberg},
title = {Negative-cycle detection algorithms},
booktitle = {Mathematical Programming},
year = {1999},
pages = {349--363}
}
Years of Citing Articles
Abstract:
We study the problem of finding a negative length cycle in a network. An algorithm for the negative cycle problem combines a shortest path algorithm and a cycle detection strategy. We study various combinations of shortest path algorithms and cycle detection strategies and find the best combinations. One of our discoveries is that a cycle detection strategy of Tarjan greatly improves practical performance of a classical shortest path algorithm, making it competitive with the fastest known algorithms on a wide range of problems. As a part of our study, we develop problem families for testing negative cycle algorithms.
