{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T14:51:16Z","timestamp":1676645476933},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1984,2,1]],"date-time":"1984-02-01T00:00:00Z","timestamp":444441600000},"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":[[1984,2]]},"DOI":"10.1016\/0020-0190(84)90024-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:20:15Z","timestamp":1027642815000},"page":"59-62","source":"Crossref","is-referenced-by-count":13,"title":["A partitioning algorithm for minimum weighted Euclidean matching"],"prefix":"10.1016","volume":"18","author":[{"given":"M.E.","family":"Dyer","sequence":"first","affiliation":[]},{"given":"A.M.","family":"Frieze","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(84)90024-3_BIB1","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0898-1221(81)90084-5","article-title":"Worst-case bounds for the Euclidean matching problem","volume":"7","author":"Avis","year":"1981","journal-title":"Internat. J. Comput. Math. Appl."},{"key":"10.1016\/0020-0190(84)90024-3_BIB2","article-title":"A survey of heuristics for the weighted matching problem","author":"Avis","year":"1982"},{"key":"10.1016\/0020-0190(84)90024-3_BIB3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","article-title":"Maximum matching and a polyhedron with 0\u20131 vertices","volume":"69","author":"Edmonds","year":"1965","journal-title":"J. Res. National Bureau of Standards"},{"key":"10.1016\/0020-0190(84)90024-3_BIB4","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/0020-0190(84)90024-3_BIB5","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0211003","article-title":"A fast algorithm for the Euclidean travelling salesman problem, optimal with probability one","volume":"11","author":"Halton","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(84)90024-3_BIB6","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/moor.2.3.209","article-title":"Probabilistic analysis of partitioning algorithms for the travelling salesman problem in the plane","volume":"2","author":"Karp","year":"1977","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0020-0190(84)90024-3_BIB7","first-page":"368","article-title":"The probabilistic analysis of matching heuristics","author":"Papadimitriou","year":"1977","journal-title":"Proc. 15th Ann. Allerton Conf. on Communication, Control and Computing"},{"key":"10.1016\/0020-0190(84)90024-3_BIB8","doi-asserted-by":"crossref","unstructured":"E.M. Reingold and K.J. Supowit, Probabilistic analysis of divide-and-conquer heuristics for minimum weighted Euclidean matching, Networks, to appear.","DOI":"10.1002\/net.3230130104"},{"key":"10.1016\/0020-0190(84)90024-3_BIB9","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1137\/0210050","article-title":"On a greedy heuristic for complete matching","volume":"10","author":"Reingold","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(84)90024-3_BIB10","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1214\/aop\/1176994411","article-title":"Subadditive Euclidean functionals and nonlinear growth in geometric probability","volume":"9","author":"Steele","year":"1981","journal-title":"Ann Probab."},{"key":"10.1016\/0020-0190(84)90024-3_BIB11","first-page":"398","article-title":"Heuristics for weighted perfect matching","author":"Supowit","year":"1980","journal-title":"Proc. 12th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(84)90024-3_BIB12","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1137\/0212008","article-title":"Divide-and-conquer heuristics for minimum weighted Euclidean matching","volume":"12","author":"Supowit","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(84)90024-3_BIB13","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1137\/0212009","article-title":"The travelling salesman problem and minimum matching in the unit square","volume":"12","author":"Supowit","year":"1983","journal-title":"Siam J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019084900243?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019084900243?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T08:53:01Z","timestamp":1555059181000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019084900243"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,2]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,2]]}},"alternative-id":["0020019084900243"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(84)90024-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1984,2]]}}}