{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T10:34:36Z","timestamp":1712399676770},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1989,6]]},"DOI":"10.1007\/bf01553909","type":"journal-article","created":{"date-parts":[[2005,4,20]],"date-time":"2005-04-20T22:07:35Z","timestamp":1114034855000},"page":"569-583","source":"Crossref","is-referenced-by-count":16,"title":["Approximate minimum weight matching on points ink-dimensional space"],"prefix":"10.1007","volume":"4","author":[{"given":"Pravin M.","family":"Vaidya","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01553909_CR1","doi-asserted-by":"crossref","first-page":"475","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, 1983, 475\u2013493.","journal-title":"Networks"},{"key":"BF01553909_CR2","doi-asserted-by":"crossref","unstructured":"K. L. Clarkson, Fast algorithms for the all nearest neighbors problem,Proc. IEEE Symp. on Foundations of Computer Science, 1983, pp. 226\u2013232.","DOI":"10.1109\/SFCS.1983.16"},{"key":"BF01553909_CR3","doi-asserted-by":"crossref","unstructured":"K. L. Clarkson, Fast expected-time and approximation algorithms for geometric minimum spanning trees,Proc. 16th Annual ACM Symp. on Theory of Computing, 1984, pp. 342\u2013348.","DOI":"10.1145\/800057.808699"},{"key":"BF01553909_CR4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, Matching and a polyhedron with 0-1 vertices,J. Res. Nat. Bur. Standards,69B, 1965, 125\u2013130.","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"BF01553909_CR5","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1145\/321941.321942","volume":"23","author":"H. Gabow","year":"1976","unstructured":"H. Gabow, An efficient implementation of Edmond's algorithm for maximum matching on graphs,J. Assoc. Compul. Mach.,23, 1976, 221\u2013234.","journal-title":"J. Assoc. Compul. Mach."},{"key":"BF01553909_CR6","doi-asserted-by":"crossref","unstructured":"H. Gabow, A scaling algorithm for weighted matching on general graphs,Proc. 26th Annual Symp. on Foundations of Computer Science, 1985, pp. 90\u2013100.","DOI":"10.1109\/SFCS.1985.3"},{"key":"BF01553909_CR7","unstructured":"H. N. Gabow and R. E. Tarjan, Faster algorithms for graph matching, Technical Report, Department of Computer Science, Princeton University, Princeton, NJ."},{"key":"BF01553909_CR8","unstructured":"M. Iri, M. Murota, and S. Matsui, Linear time heuristics for minimum-weight perfect matching on a plane with an application to the plotter algorithm. Unpublished (1980)."},{"key":"BF01553909_CR9","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0196-6774(84)90024-5","volume":"5","author":"D. A. Plaisted","year":"1984","unstructured":"D. A. Plaisted, Heuristic matching for graphs satisfying the triangle inequality,J. Algorithms,5, 1984, 163\u2013179.","journal-title":"J. Algorithms"},{"key":"BF01553909_CR10","unstructured":"H. Samet, The quadtree and related hierarchical data structures, Technical Report, Department of Computer Science, University of Maryland, College Park, MD."},{"key":"BF01553909_CR11","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1137\/0212008","volume":"12","author":"K. J. Supowit","year":"1983","unstructured":"K. J. Supowit and E. M. Reingold, Divide-and-conquer heuristics for minimum weighted Euclidean matching,SIAM J. Comput.,12, 1983, 118\u2013143.","journal-title":"SIAM J. Comput."},{"key":"BF01553909_CR12","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"R. E. Tarjan","year":"1983","unstructured":"R. E. Tarjan,Data Structures and Network Algorithms, SIAM, Philadelphia, PA, 1983."},{"key":"BF01553909_CR13","doi-asserted-by":"crossref","unstructured":"P. M. Vaidya, An optimal algorithm for the all-nearest-neighbors problem,Proc. 27th Annual Symp. on Foundations of Computer Science, 1986.","DOI":"10.1109\/SFCS.1986.8"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01553909.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01553909\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01553909","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T14:21:13Z","timestamp":1556893273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01553909"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":13,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["BF01553909"],"URL":"https:\/\/doi.org\/10.1007\/bf01553909","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}