{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T12:19:57Z","timestamp":1790511597440,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642382666","type":"print"},{"value":"9783642382673","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38267-3_38","type":"book-chapter","created":{"date-parts":[[2013,5,19]],"date-time":"2013-05-19T21:08:18Z","timestamp":1368997698000},"page":"452-464","source":"Crossref","is-referenced-by-count":23,"title":["A Hierarchical Approach to Optimal Transport"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"Schmitzer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christoph","family":"Schn\u00f6rr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"38_CR1","unstructured":"Bertsekas, D.P.: A distributed algorithm for the assignment problem. Tech. rep., Lab. for Information and Decision Systems Report, MIT (May 1979)"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02186476","volume":"14","author":"D.P. Bertsekas","year":"1988","unstructured":"Bertsekas, D.P.: The auction algorithm: A distributed relaxation method for the assignment problem. Annals of Operations Research\u00a014, 105\u2013123 (1988)","journal-title":"Annals of Operations Research"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BF01589405","volume":"42","author":"D.P. Bertsekas","year":"1988","unstructured":"Bertsekas, D.P., Eckstein, J.: Dual coordinate step methods for linear network flow problems. Mathematical Programming, Series B\u00a042, 203\u2013243 (1988)","journal-title":"Mathematical Programming, Series B"},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF02216923","volume":"20","author":"D. Bertsekas","year":"1989","unstructured":"Bertsekas, D., Castanon, D.: The auction algorithm for the transportation problem. Annals of Operations Research\u00a020, 67\u201396 (1989)","journal-title":"Annals of Operations Research"},{"key":"38_CR5","doi-asserted-by":"publisher","first-page":"2554","DOI":"10.1137\/080740647","volume":"41","author":"G. Carlier","year":"2010","unstructured":"Carlier, G., Galichon, A., Santambrogio, F.: From Knothe\u2019s transport to Brenier\u2019s map and a continuation method for optimal transport. SIAM J.\u00a0Math.\u00a0Anal.\u00a041, 2554\u20132576 (2010)","journal-title":"SIAM J.\u00a0Math.\u00a0Anal."},{"key":"38_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1023\/B:VISI.0000036836.66311.97","volume":"60","author":"S. Haker","year":"2004","unstructured":"Haker, S., Zhu, L., Tannenbaum, A., Angenent, S.: Optimal mass transport for registration and warping. Int. J. Comput. Vision\u00a060, 225\u2013240 (2004)","journal-title":"Int. J. Comput. Vision"},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H.W. Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The hungarian method for the assignment problem. Naval Research Logistics\u00a02, 83\u201397 (1955)","journal-title":"Naval Research Logistics"},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10208-011-9093-5","volume":"11","author":"F. M\u00e9moli","year":"2011","unstructured":"M\u00e9moli, F.: Gromov-Wasserstein distances and the metric approach to object matching. Found.\u00a0Comp.\u00a0Math.\u00a011, 417\u2013487 (2011)","journal-title":"Found.\u00a0Comp.\u00a0Math."},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"Pele, O., Werman, W.: Fast and Robust Earth Mover\u2019s Distances. In: Proc.\u00a0Int.\u00a0Conf.\u00a0Comp.\u00a0Vision, ICCV (2009)","DOI":"10.1109\/ICCV.2009.5459199"},{"key":"38_CR10","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, Algorithms and Combinatorics, vol.\u00a024. Springer (2003)"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Shirdhonkar, S., Jacobs, D.W.: Approximate earth mover\u2019s distance in linear time. In: IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2008 (2008)","DOI":"10.1109\/CVPR.2008.4587662"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"Villani, C.: Optimal Transport: Old and New. Springer (2009)","DOI":"10.1007\/978-3-540-71050-9"},{"key":"38_CR13","doi-asserted-by":"crossref","unstructured":"Wang, W., Slep\u010dev, D., Basu, S., Ozolek, J.A., Rohde, G.K.: A linear optimal transportation framework for quantifying and visualizing variations in sets of images. International Journal of Computer Vision pp. 1\u201316 (2012)","DOI":"10.1007\/s11263-012-0566-z"}],"container-title":["Lecture Notes in Computer Science","Scale Space and Variational Methods in Computer Vision"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38267-3_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,17]],"date-time":"2022-02-17T06:41:13Z","timestamp":1645080073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38267-3_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382666","9783642382673"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38267-3_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}