{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:54:04Z","timestamp":1725472444944},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291329"},{"type":"electronic","value":"9783540320869"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561354_27","type":"book-chapter","created":{"date-parts":[[2005,10,5]],"date-time":"2005-10-05T12:12:28Z","timestamp":1128514348000},"page":"320-333","source":"Crossref","is-referenced-by-count":1,"title":["Stressing is Better Than Relaxing for Negative Cost Cycle Detection in Networks"],"prefix":"10.1007","author":[{"given":"K.","family":"Subramani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"27_CR2","first-page":"129","volume":"73","author":"B.V. Cherkassky","year":"1996","unstructured":"Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: Theory and experimental evaluation. Mathematical Programming\u00a073, 129\u2013174 (1996)","journal-title":"Mathematical Programming"},{"unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms, 2nd edn. MIT Press and McGraw-Hill Book Company, Boston (1992)","key":"27_CR3"},{"key":"27_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman Company, San Francisco (1979)"},{"issue":"3","key":"27_CR5","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1137\/S0097539792231179","volume":"24","author":"A.V. Goldberg","year":"1995","unstructured":"Goldberg, A.V.: Scaling algorithms for the shortest paths problem. SIAM Journal on Computing\u00a024(3), 494\u2013504 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"27_CR6","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1987","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley and Sons, New York (1987)"},{"issue":"4","key":"27_CR7","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1016\/j.future.2004.09.001","volume":"21","author":"K. Subramani","year":"2005","unstructured":"Subramani, K., Kovalchick, L.: A greedy strategy for detecting negative cost cycles in networks. Future Generation Computer Systems\u00a021(4), 607\u2013623 (2005)","journal-title":"Future Generation Computer Systems"}],"container-title":["Lecture Notes in Computer Science","Ad-Hoc, Mobile, and Wireless Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561354_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:13:48Z","timestamp":1619507628000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561354_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291329","9783540320869"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11561354_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}