{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T10:31:34Z","timestamp":1673692294707},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1995,5,1]],"date-time":"1995-05-01T00:00:00Z","timestamp":799286400000},"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":[[1995,5]]},"DOI":"10.1007\/bf01190848","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T11:21:25Z","timestamp":1108725685000},"page":"442-461","source":"Crossref","is-referenced-by-count":7,"title":["Using geometry to solve the transportation problem in the plane"],"prefix":"10.1007","volume":"13","author":[{"given":"D. S.","family":"Atkinson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. M.","family":"Vaidya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"The Design and Anaysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman.The Design and Anaysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1137\/0215023","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"H. Edelsbrunner, L. J. Guibas, and J. Stolfi, Optimal point location in a monotone subdivision,SIAM J. Comput. 15(1986), 317?340.","journal-title":"SIAM J. Comput."},{"issue":"2","key":"CR3","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"J. Edmonds and R. M. Karp, Theoretical improvements in algorithmic efficiency for network flow problems,J. Assoc. Comput. Mach. 19(2) (1972), 248?264.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01840357","volume":"2","author":"S. Fortune","year":"1987","unstructured":"S. Fortune, A sweeping algorithm for Voronoi diagrams,Algorithmica 2 (1987), 153?174.","journal-title":"Algorithmica"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1137\/0218069","volume":"18","author":"H. N. Gabow","year":"1989","unstructured":"H. N. Gabow and R. E. Tarjan, Faster scaling algorithms for network problems,SIAM J. Comput. 18 (1989), 1013?1036.","journal-title":"SIAM J. Comput."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0206043","volume":"6","author":"D. T. Lee","year":"1977","unstructured":"D. T. Lee and F. P. Preparata, Location of a point in a planar subdivision and its applications,SIAM J. Comput. 6 (1977), 594?606.","journal-title":"SIAM J. Comput."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF02574686","volume":"6","author":"K. Mehlhorn","year":"1991","unstructured":"K. Mehlhorn, St. Meiser, and Co. \u00d3'D\u00fanlaing, On the construction of abstract Voronoi diagrams,Discrete Comput. Geom. 6 (1991), 211?224.","journal-title":"Discrete Comput. Geom."},{"key":"CR8","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C. H. Papadimitriou","year":"1982","unstructured":"C. H. Papadimitriou and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982."},{"key":"CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos,Computational Geometry: An Introduction, Springer-Verlag, Berlin, 1985."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1137\/0214034","volume":"14","author":"M. Sharir","year":"1985","unstructured":"M. Sharir, Intersection and closest-pair problems for a set of planar discs,SIAM J. Comput. 14 (1985), 448?468.","journal-title":"SIAM J. Comput."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1137\/0218080","volume":"18","author":"P. M. Vaidya","year":"1989","unstructured":"P. M. Vaidya, Geometry helps in matching,SIAM J. Comput. 18 (1989), 1201?1225.","journal-title":"SIAM J. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01190848.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01190848\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01190848","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T13:08:23Z","timestamp":1556629703000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01190848"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,5]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1995,5]]}},"alternative-id":["BF01190848"],"URL":"https:\/\/doi.org\/10.1007\/bf01190848","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,5]]}}}