{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T17:20:14Z","timestamp":1649179214386},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1988,3,1]],"date-time":"1988-03-01T00:00:00Z","timestamp":573177600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1988,3]]},"DOI":"10.1007\/bf01934691","type":"journal-article","created":{"date-parts":[[2005,7,25]],"date-time":"2005-07-25T05:46:04Z","timestamp":1122270364000},"page":"19-26","source":"Crossref","is-referenced-by-count":0,"title":["Greedy matching on a grid"],"prefix":"10.1007","volume":"28","author":[{"given":"Rolf G.","family":"Karlsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"BF01934691_CR1","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1002\/net.3230130404","volume":"13","author":"D. Avis","year":"1983","unstructured":"D. Avis,A survey of heuristics for the weighted matching problem, Networks 13, 4 (1983), 495\u2013516.","journal-title":"Networks"},{"key":"BF01934691_CR2","unstructured":"J. L. Bentley,Divide and conquer algorithms for closest problems in multidimensional space, unpublished Ph.D. Thesis, University of North Carolina (1976)."},{"issue":"4","key":"BF01934691_CR3","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0196-6774(80)90015-2","volume":"1","author":"J. L. Bentley","year":"1980","unstructured":"J. L. Bentley and J. B. Saxe,Decomposable searching problems. I.static-to-dynamic transformation, J. Algorithms 1, 4 (1980), 301\u2013358.","journal-title":"J. Algorithms"},{"key":"BF01934691_CR4","doi-asserted-by":"crossref","unstructured":"H. N. Gabow,A scaling algorithm for weighted matching on general graphs, Proc. 26th Annual IEEE Symposium on Foundations of Computer Science (1985), 90\u2013100.","DOI":"10.1109\/SFCS.1985.3"},{"key":"BF01934691_CR5","doi-asserted-by":"crossref","unstructured":"R. G. Karlsson and J. I. Munro,Proximity on a grid, Proc. 2nd Symposium on Theoretical Aspects of Computer Science (1985), Springer-Verlag, Lecture Notes in Computer Science 182, 187\u2013196.","DOI":"10.1007\/BFb0024008"},{"key":"BF01934691_CR6","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(83)90023-3","volume":"28","author":"D. Kirkpatrick","year":"1984","unstructured":"D. Kirkpatrick and S. Reisch,Upper bounds for sorting integers on random access machines, Theoretical Computer Science 28 (1984), 263\u2013276.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"BF01934691_CR7","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1137\/0209017","volume":"9","author":"D. T. Lee","year":"1980","unstructured":"D. T. Lee and C. K. Wong,Voronoi diagrams in L 1 (L\u221e)metrics with 2-dimensional storage applications, SIAM J. Comput. 9, 1 (1980), 200\u2013211.","journal-title":"SIAM J. Comput."},{"issue":"4","key":"BF01934691_CR8","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1137\/0210050","volume":"10","author":"E. M. Reingold","year":"1981","unstructured":"E. M. Reingold and R. E. Tarjan,On a greedy heuristic for complete matching, SIAM J. Comput. 10, 4 (1981), 676\u2013681.","journal-title":"SIAM J. Comput."}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01934691.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01934691\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01934691","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T01:10:04Z","timestamp":1557450604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01934691"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,3]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,3]]}},"alternative-id":["BF01934691"],"URL":"https:\/\/doi.org\/10.1007\/bf01934691","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,3]]}}}