论文信息 - Contraction versus Relaxation: A Comparison of Two Approaches for the Negative Cost Cycle Detection Problem

Contraction versus Relaxation: A Comparison of Two Approaches for the Negative Cost Cycle Detection Problem

In this paper, we develop a greedy algorithm for the negative cost cycle detection problem and empirically contrast its performance with the "standard" Bellman-Ford (BF) algorithm for the same problem. Our experiments indicate that the greedy approach is superior to the dynamic programming approach of BF, on a wide variety of inputs.

K. Subramani | Lisa Kovalchick | K. Subramani | L. Kovalchick

[1] Rina Dechter,et al. Temporal Constraint Networks , 1989, Artif. Intell..

[2] William Pugh,et al. A practical algorithm for exact array dependence analysis , 1992, CACM.

[3] Neil Weste,et al. Principles of CMOS VLSI Design , 1985 .

[4] Andrew V. Goldberg,et al. Negative-Cycle Detection Algorithms , 1996, ESA.

[5] Clifford Stein,et al. Introduction to Algorithms, 2nd edition. , 2001 .

[6] K. Subramani,et al. An Analysis of Zero-Clairvoyant Scheduling , 2002, TACAS.

[7] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .

[8] William Pugh,et al. The Omega test: A fast and practical integer programming algorithm for dependence analysis , 1991, Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).

[9] Andrew V. Goldberg,et al. Scaling algorithms for the shortest paths problem , 1995, SODA '93.