{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T23:01:26Z","timestamp":1768690886548,"version":"3.49.0"},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"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":[[1991,5]]},"DOI":"10.1016\/0020-0190(91)90233-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"123-127","source":"Crossref","is-referenced-by-count":182,"title":["Computing the minimum Hausdorff distance between two point sets on a line under translation"],"prefix":"10.1016","volume":"38","author":[{"given":"G\u00fcnter","family":"Rote","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(91)90233-8_BIB1","first-page":"80","article-title":"Lower bounds for algebraic computation trees","author":"Ben-Or","year":"1983","journal-title":"Proc. 15th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(91)90233-8_BIB2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0377-0427(90)90026-V","article-title":"Cyclic schedules for r irregularly occuring events","volume":"30","author":"Brucker","year":"1990","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/0020-0190(91)90233-8_BIB3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0166-218X(88)90056-X","article-title":"Scheduling two irregular polygons","volume":"20","author":"Brucker","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(91)90233-8_BIB4","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0166-218X(86)90040-5","article-title":"Optimal schedules for periodically recurring events","volume":"15","author":"Burkard","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(91)90233-8_BIB5","series-title":"Computing the minimum Hausdroff distance for point sets under translation","first-page":"340","author":"Huttenlocher","year":"1990"},{"key":"10.1016\/0020-0190(91)90233-8_BIB6","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01840442","article-title":"Geometric complexity of some location problems","volume":"1","author":"Lee","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0020-0190(91)90233-8_BIB7","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/0020-0190(91)90233-8_BIB8","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0020-0190(87)90141-4","article-title":"Obtaining lower bounds using artificial components","volume":"24","author":"Ramanan","year":"1987","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019091902338?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019091902338?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:24:05Z","timestamp":1555143845000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019091902338"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["0020019091902338"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90233-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}