{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T11:21:59Z","timestamp":1774956119599,"version":"3.50.1"},"reference-count":3,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1016\/0020-0190(94)90101-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"287-290","source":"Crossref","is-referenced-by-count":7,"title":["Extending the quadrangle inequality to speed-up dynamic programming"],"prefix":"10.1016","volume":"49","author":[{"given":"Al","family":"Borchers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prosenjit","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)90101-5_BIB1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1080\/00207169208804147","article-title":"The Towers of Hanoi: Generalizations, specializations and algorithms","volume":"46","author":"Gupta","year":"1993","journal-title":"Internat. J. Comput. Math."},{"issue":"2\u20133","key":"10.1016\/0020-0190(94)90101-5_BIB2","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF01758762","article-title":"The Rectilinear Steiner Arborescence Problem","volume":"7","author":"Rao","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/0020-0190(94)90101-5_BIB3","first-page":"429","article-title":"Efficient dynamic programming using quadrangle inequalities","author":"Yao","year":"1980","journal-title":"Proc. 12th Ann. ACM Symp. on Theory of Computing"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094901015?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094901015?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:50:08Z","timestamp":1555131008000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094901015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":3,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0020019094901015"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)90101-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}