Abstract
This paper is concerned with the problem of checking whether a network with positive and negative costs on its arcs contains a negative cost cycle. We introduce a fundamentally new approach for negative cost cycle detection; our approach, which we term as the Stressing Algorithm, is based on exploiting the connections between the Negative Cost Cyle Detection (NCCD) problem and the problem of checking whether a system of difference constraints is feasible. The Stressing Algorithm is an incremental, comparison-based procedure which is asymptotically optimal, modulo the fastest comparison-based algorithm for this problem. In particular, on a network with n vertices and m edges, the Stressing Algorithm takes O(m n) time to detect the presence of a negative cost cycle or to report that none exist. A very important feature of the Stressing Algorithm is that it uses zero extra space; this is in marked contrast to all known algorithms that require Ω(n ) extra space.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs (1993)
Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: Theory and experimental evaluation. Mathematical Programming 73, 129–174 (1996)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms, 2nd edn. MIT Press and McGraw-Hill Book Company, Boston (1992)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman Company, San Francisco (1979)
Goldberg, A.V.: Scaling algorithms for the shortest paths problem. SIAM Journal on Computing 24(3), 494–504 (1995)
Schrijver, A.: Theory of Linear and Integer Programming. John Wiley and Sons, New York (1987)
Subramani, K., Kovalchick, L.: A greedy strategy for detecting negative cost cycles in networks. Future Generation Computer Systems 21(4), 607–623 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Subramani, K. (2005). Stressing is Better Than Relaxing for Negative Cost Cycle Detection in Networks. In: Syrotiuk, V.R., Chávez, E. (eds) Ad-Hoc, Mobile, and Wireless Networks. ADHOC-NOW 2005. Lecture Notes in Computer Science, vol 3738. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561354_27
Download citation
DOI: https://doi.org/10.1007/11561354_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29132-9
Online ISBN: 978-3-540-32086-9
eBook Packages: Computer ScienceComputer Science (R0)