{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T10:43:46Z","timestamp":1749725026767},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401964"},{"type":"electronic","value":"9783540448631"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44863-2_38","type":"book-chapter","created":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T17:45:55Z","timestamp":1192902355000},"page":"377-387","source":"Crossref","is-referenced-by-count":2,"title":["Contraction versus Relaxation: A Comparison of Two Approaches for the Negative Cost Cycle Detection Problem"],"prefix":"10.1007","author":[{"given":"K.","family":"Subramani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Kovalchick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"38_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/3-540-61680-2_67","volume-title":"Algorithms\u2014ESA\u2019 96, Fourth Annual European Symposium","author":"B. V. Cherkassky","year":"1996","unstructured":"Boris V. Cherkassky and Andrew V. Goldberg. Negative-cycle detection algorithms. In Josep D\u00edaz and Maria Serna, editors, Algorithms\u2014ESA\u2019 96, Fourth Annual European Symposium, volume 1136 of Lecture Notes in Computer Science, pages 349\u2013363, Barcelona, Spain, 25\u201327 September 1996. Springer."},{"key":"38_CR2","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press and McGraw-Hill Book Company, 6th edition, 1992."},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R. Dechter","year":"1991","unstructured":"R. Dechter, I. Meiri, and J. Pearl. Temporal constraint networks. Artificial Intelligence, 49: 61\u201395, 1991.","journal-title":"Artificial Intelligence"},{"issue":"3","key":"38_CR4","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1137\/S0097539792231179","volume":"24","author":"A. V. Goldberg","year":"1995","unstructured":"Andrew V. Goldberg. Scaling algorithms for the shortest paths problem. SIAM Journal on Computing, 24(3):494\u2013504, June 1995.","journal-title":"SIAM Journal on Computing"},{"issue":"8","key":"38_CR5","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1145\/135226.135233","volume":"35","author":"W. Pugh","year":"1992","unstructured":"W. Pugh. The omega test: A fast and practical integer programming algorithm for dependence analysis. Comm. of the ACM, 35(8):102\u2013114, August1992.","journal-title":"Comm. of the ACM"},{"key":"38_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/3-540-46002-0_8","volume-title":"Proceedings of the 8th International Conference on Tools and Algorithms for the construction of Systems (TACAS)","author":"K. Subramani","year":"2002","unstructured":"K. Subramani. An analysis of zero-clairvoyant scheduling. In Joost-Pieter Katoen and Perdita Stevens, editors, Proceedings of the 8\n                           \n                    th\n                  \n                           International Conference on Tools and Algorithms for the construction of Systems (TACAS), volume 2280 of Lecture Notes in Computer Science, pages 98\u2013112. Springer-Verlag, April 2002."},{"key":"38_CR7","unstructured":"Neil H. Weste and Kamran Eshragian. Principles of CMOS VLSI Design. Addison Wesley, 1994."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2014 ICCS 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44863-2_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T08:39:16Z","timestamp":1550997556000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44863-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401964","9783540448631"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-44863-2_38","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}