Sketching Earth-Mover Distance on Graph Metrics

DOI10.1007/978-3-642-40328-6_20zbMath1405.68250OpenAlexW1035080392MaRDI QIDQ2851863

Daniel M. Stubbs, Andrew McGregor

Publication date: 4 October 2013

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40328-6_20

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Approximation algorithms (68W25)

Related Items (3)

On computing discretized Ricci curvatures of graphs: local algorithms and (localized) fine-grained reductions ⋮ Wasserstein distance and metric trees ⋮ The ultrametric Gromov-Wasserstein distance

This page was built for publication: Sketching Earth-Mover Distance on Graph Metrics