{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:40:01Z","timestamp":1758271201011},"reference-count":4,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"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":[[1993,8]]},"DOI":"10.1016\/0020-0190(93)90149-4","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T19:27:56Z","timestamp":1034278076000},"page":"1-4","source":"Crossref","is-referenced-by-count":9,"title":["Approximate parametric searching"],"prefix":"10.1016","volume":"47","author":[{"given":"Sivan","family":"Toledo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90149-4_BIB1","series-title":"Tech. Rept. GSIA","article-title":"Worst-case analysis of a new heuristic for the Traveling Salesman Problem","author":"Christofides","year":"1976"},{"key":"10.1016\/0020-0190(93)90149-4_BIB2","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1145\/7531.7537","article-title":"Slowing down sorting networks to obtain faster sorting algorithms","volume":"34","author":"Cole","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(93)90149-4_BIB3","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","article-title":"Applying parallel computation in the design of serial algorithms","volume":"30","author":"Megiddo","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(93)90149-4_BIB4","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1137\/0204030","article-title":"Parallelism in comparison problems","volume":"4","author":"Valiant","year":"1975","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019093901494?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019093901494?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T08:52:36Z","timestamp":1554972756000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019093901494"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["0020019093901494"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90149-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,8]]}}}