Fetching the paper…
Reading the bibliography…
This paper presents a framework for computing the Gromov-Wasserstein problem between two sets of points in low dimensional spaces, where the discrepancy is the squared Euclidean norm.
Assignment problems and the location of economic activities
Tjalling C Koopmans and Martin Beckmann · 1957
Earlier work this paper cites.
Solving linear programming problems in integers
Ralph E Gomory · 1960
Earlier work this paper cites.
Quadratic programming with one negative eigenvalue is NP-hard
Panos M Pardalos and Stephen A Vavasis · 1991
Earlier work this paper cites.
A polynomial time primal network simplex algorithm for minimum cost flows
J.B. Orlin · 1997
Earlier work this paper cites.
The quadratic assignment problem
Rainer E Burkard, Eranda Cela, Panos M Pardalos, and Leonidas S Pitsoulis · 1998
Earlier work this paper cites.
Topics in Optimal Transportation
C. Villani · 2003
Earlier work this paper cites.
Displacement interpolation using lagrangian mass transport
Nicolas Bonneel, Michiel Van De Panne, Sylvain Paris, and Wolfgang Heidrich · 2011
Earlier work this paper cites.
Gromov–Wasserstein distances and the metric approach to object matching
Facundo Mémoli · 2011
Earlier work this paper cites.
Assignment problems: revised reprint
Rainer Burkard, Mauro Dell’Amico, and Silvano Martello · 2012
Cited alongside, same era.
Sinkhorn distances: Lightspeed computation of optimal transport
Marco Cuturi · 2013
Cited alongside, same era.
Deterministic global optimization: theory, methods and applications
Christodoulos A Floudas · 2013
Cited alongside, same era.
Gromov-Wasserstein averaging of kernel and distance matrices
Gabriel Peyré, Marco Cuturi, and Justin Solomon · 2016
Cited alongside, same era.
Entropic metric alignment for correspondence problems
Justin Solomon, Gabriel Peyré, Vladimir G Kim, and Suvrit Sra · 2016
Cited alongside, same era.
Gwcnn: A metric alignment layer for deep shape analysis
Danielle Ezuz, Justin Solomon, Vladimir G Kim, and Mirela Ben-Chen · 2017
Cited alongside, same era.
Semi-supervised optimal transport for heterogeneous domain adaptation
Yuguang Yan, Wen Li, Hanrui Wu, Huaqing Min, Mingkui Tan, and Qingyao Wu · 2018
Later among the works it cites.
Low rank quadratic assignment problem: Formulations and experimental analysis
Michael Friesen · 2019
Later among the works it cites.
Scalable Gromov-Wasserstein learning for graph partitioning and matching
Hongteng Xu, Dixin Luo, and Lawrence Carin · 2019
Later among the works it cites.
Gromov-Wasserstein learning for graph matching and node embedding
Hongteng Xu, Dixin Luo, Hongyuan Zha, and Lawrence Carin Duke · 2019
Later among the works it cites.
Gromov-Wasserstein optimal transport to align single-cell multi-omics data
Pinar Demetci, Rebecca Santorella, Björn Sandstede, William Stafford Noble, and Ritambhara Singh · 2020
Later among the works it cites.
On a linear Gromov–Wasserstein distance
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Gromov-Wasserstein alignment of word embedding spaces
David Alvarez-Melis and Tommi S Jaakkola · 2018
Cited alongside, same era.
Efficient local optimization for low-rank large-scale instances of the quadratic assignment problem
Cole Stiegler · 2018
Cited alongside, same era.
Florian Beier, Robert Beinert, and Gabriele Steidl · 2022
Later among the works it cites.
Linear-time Gromov-Wasserstein distances using low rank couplings and costs
Meyer Scetbon, Gabriel Peyré, and Marco Cuturi · 2022
Later among the works it cites.