{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:21:22Z","timestamp":1725567682252},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540218364"},{"type":"electronic","value":"9783540246640"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24664-0_13","type":"book-chapter","created":{"date-parts":[[2010,10,23]],"date-time":"2010-10-23T14:59:59Z","timestamp":1287845999000},"page":"190-199","source":"Crossref","is-referenced-by-count":3,"title":["Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights"],"prefix":"10.1007","author":[{"given":"Irit","family":"Katriel","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. Assoc. Comput. Mach.\u00a034, 596\u2013615 (1987)","journal-title":"J. Assoc. Comput. Mach."},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1007\/978-3-540-45193-8_37","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"L. Michel","year":"2003","unstructured":"Michel, L., Van Hentenryck, P.: Maintaining longest paths incrementally. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 540\u2013554. Springer, Heidelberg (2003)"},{"issue":"1-2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0304-3975(95)00079-8","volume":"158","author":"G. Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.: On the computational complexity of dynamic graph problems. Theor. Comput. Sci.\u00a0158(1-2), 233\u2013277 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Mikkel Thorup. Integer priority queues with decrease key in constant time and the single source shortest paths problem. In Proc. 35th ACM Symp. on Theory\n                           of Computing (STOC), pages 149\u2013158, 2003.","DOI":"10.1145\/780542.780566"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24664-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T23:03:46Z","timestamp":1558307026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24664-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540218364","9783540246640"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24664-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}