Fetching the paper…
Reading the bibliography…
Multimarginal Optimal Transport (MOT) has attracted significant interest due to applications in machine learning, statistics, and the sciences.
On the shortest spanning subtree of a graph and the traveling salesman problem
J. B. Kruskal · 1956
Earlier work this paper cites.
Reliable circuits using less reliable relays
E. F. Moore and C. E. Shannon · 1956
Earlier work this paper cites.
Diagonal equivalence to matrices with prescribed row and column sums
R. Sinkhorn · 1967
Earlier work this paper cites.
The use of entropy maximising models, in the theory of trip distribution, mode split and route split
A. G. Wilson · 1969
Earlier work this paper cites.
Informational complexity and efficient methods for the solution of convex extremal problems
D. B. Yudin and A. S. Nemirovskii · 1976
Earlier work this paper cites.
Convex majorization with an application to the length of critical paths
I. Meilijson and A. Nádas · 1979
Earlier work this paper cites.
Probabilistic PERT
A. Nadas · 1979
Earlier work this paper cites.
The complexity of enumeration and reliability problems
L. G. Valiant · 1979
Earlier work this paper cites.
Polynomial algorithms in linear programming
L. G. Khachiyan · 1980
Earlier work this paper cites.
The ellipsoid method and its consequences in combinatorial optimization
M. Grötschel, L. Lovász, and A. Schrijver · 1981
Earlier work this paper cites.
Estimates for the distribution function of a sum of two random variables when the marginal distributions are fixed
G. Makarov · 1982
Earlier work this paper cites.
Random variables with maximum sums
L. Rüschendorf · 1982
Earlier work this paper cites.
Polynomial algorithms for estimating network reliability
E. Zemel · 1982
Earlier work this paper cites.
The complexity of counting cuts and of computing the probability that a graph is connected
J. S. Provan and M. O. Ball · 1983
Earlier work this paper cites.
Computational complexity of network reliability analysis: An overview
M. O. Ball · 1986
Earlier work this paper cites.
Robustness against dependence in PERT: An application of duality and distributions with known marginals
W. K. Haneveld · 1986
Earlier work this paper cites.
Stochastic bounds on distributions of optimal value functions with applications to PERT, network flows and reliability
G. Weiss · 1986
Earlier work this paper cites.
The least action principle and the related concept of generalized flows for incompressible perfect fluids
Y. Brenier · 1989
Earlier work this paper cites.
The dual least action problem for an ideal, incompressible fluid
Y. Brenier · 1993
Earlier work this paper cites.
Network reliability
M. O. Ball, C. J. Colbourn, and J. S. Provan · 1995
Earlier work this paper cites.
A linear-time algorithm for finding tree-decompositions of small treewidth
H. L. Bodlaender · 1996
Earlier work this paper cites.
Introduction to linear optimization
D. Bertsimas and J. N. Tsitsiklis · 1997
Earlier work this paper cites.
A simple min-cut algorithm
M. Stoer and F. Wagner · 1997
Earlier work this paper cites.
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
N. Linial, A. Samorodnitsky, and A. Wigderson · 1998
Earlier work this paper cites.
Minimal geodesics on groups of volume-preserving maps and generalized solutions of the Euler equations
Y. Brenier · 1999
Earlier work this paper cites.
On the relative complexity of approximate counting problems
M. Dyer, L. A. Goldberg, C. Greenhill, and M. Jerrum · 2000
Earlier work this paper cites.
A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem
D. R. Karger · 2001
Earlier work this paper cites.
Sequential and parallel algorithms for mixed packing and covering
N. E. Young · 2001
Earlier work this paper cites.
On the n-coupling problem
L. Rüschendorf and L. Uckelmann · 2002
Earlier work this paper cites.
The unified propagation and scaling algorithm
Y. W. Teh and M. Welling · 2002
Earlier work this paper cites.
Topics in optimal transportation
C. Villani · 2003
Earlier work this paper cites.
Variational inference in graphical models: The view from the marginal polytope
M. J. Wainwright and M. I. Jordan · 2003
Cited alongside, same era.
Treewidth: Structure and algorithms
H. L. Bodlaender · 2007
Cited alongside, same era.
The complexity of ferromagnetic Ising with local fields
L. A. Goldberg and M. Jerrum · 2007
Cited alongside, same era.
Automated colour grading using colour distribution transfer
F. Pitié, A. C. Kokaram, and R. Dahyot · 2007
Cited alongside, same era.
Generalized solutions and hydrostatic approximation of the Euler equations
Y. Brenier · 2008
Cited alongside, same era.
Learning mixtures of product distributions over discrete domains
J. Feldman, R. O’Donnell, and R. A. Servedio · 2008
Cited alongside, same era.
A numerical method to solve multi-marginal optimal transport problems with Coulomb cost
J.-D. Benamou, G. Carlier, and L. Nenna · 2016
Later among the works it cites.
Optimal transport for domain adaptation
N. Courty, R. Flamary, D. Tuia, and A. Rakotomamonjy · 2016
Later among the works it cites.
Numerical methods for multi-marginal optimal transportation
L. Nenna · 2016
Later among the works it cites.
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
J. Altschuler, J. Weed, and P. Rigollet · 2017
Later among the works it cites.
Tsallis regularized optimal transport and ecological inference
B. Muzellec, R. Nock, G. Patrini, and F. Nielsen · 2017
Later among the works it cites.
Computational optimal transport
G. Peyré and M. Cuturi · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Computing correlated equilibria in multi-player games
C. H. Papadimitriou and T. Roughgarden · 2008
Cited alongside, same era.
Graphical models, exponential families, and variational inference
M. J. Wainwright and M. I. Jordan · 2008
Cited alongside, same era.
Tensor decompositions and applications
T. G. Kolda and B. W. Bader · 2009
Cited alongside, same era.
Probabilistic graphical models: principles and techniques
D. Koller and N. Friedman · 2009
Cited alongside, same era.
Persistency model and its applications in choice modeling
K. Natarajan, M. Song, and C.-P. Teo · 2009
Cited alongside, same era.
Matching for teams
G. Carlier and I. Ekeland · 2010
Cited alongside, same era.
Towards optimal running times for optimal transport
J. Blanchet, A. Jambulapati, C. Kent, and A. Sidford · 2018
Later among the works it cites.
Smooth and sparse optimal transport
M. Blondel, V. Seguy, and A. Rolet · 2018
Later among the works it cites.
Approximating optimal transport with linear programs
K. Quanrud · 2018
Later among the works it cites.
Scalable Bayes via barycenter in Wasserstein space
S. Srivastava, C. Li, and D. B. Dunson · 2018
Later among the works it cites.
Massively scalable Sinkhorn distances via the Nyström method
J. Altschuler, F. Bach, A. Rudi, and J. Niles-Weed · 2019
Later among the works it cites.
An entropy minimization approach to second-order variational mean-field games
J.-D. Benamou, G. Carlier, S. Di Marino, and L. Nenna · 2019
Later among the works it cites.
Generalized incompressible flows, multi-marginal transport and Sinkhorn algorithm
J.-D. Benamou, G. Carlier, and L. Nenna · 2019
Later among the works it cites.
A polynomial-time approximation algorithm for all-terminal network reliability
H. Guo and M. Jerrum · 2019
Later among the works it cites.
Estimating ensemble flows on a hidden Markov chain
I. Haasler, A. Ringh, Y. Chen, and J. Karlsson · 2019
Later among the works it cites.
On the complexity of approximating multimarginal optimal transport
T. Lin, N. Ho, M. Cuturi, and M. I. Jordan · 2019
Later among the works it cites.
Approximation theory and approximation practice
L. N. Trefethen · 2019
Later among the works it cites.
Probabilistic optimal transport based on collective graphical models
Y. Akagi, Y. Tanaka, T. Iwata, T. Kurashima, and H. Toda · 2020
Closest in time.
Multi-marginal optimal transport using partial information with applications in robust localization and sensor fusion
F. Elvander, I. Haasler, A. Jakobsson, and J. Karlsson · 2020
Closest in time.
Optimal transport, distance between sets of measures and tensor scaling
S. Friedland · 2020
Closest in time.
Multi-marginal optimal transport and Schrödinger bridges on trees
I. Haasler, A. Ringh, Y. Chen, and J. Karlsson · 2020
Closest in time.
Incremental inference of collective graphical models
R. Singh, I. Haasler, Q. Zhang, J. Karlsson, and Y. Chen · 2020
Closest in time.
Multimarginal optimal transport by accelerated alternating minimization
N. Tupitsa, P. Dvurechensky, A. Gasnikov, and C. A. Uribe · 2020
Closest in time.
Hardness results for Multimarginal Optimal Transport problems
J. M. Altschuler and E. Boix-Adserà · 2021
Closest in time.
Wasserstein barycenters can be computed in polynomial time in fixed dimension
J. M. Altschuler and E. Boix-Adserà · 2021
Closest in time.
Scalable computation of dynamic flow problems via multi-marginal graph-structured optimal transport
I. Haasler, A. Ringh, Y. Chen, and J. Karlsson · 2021
Closest in time.
Multi-marginal optimal transport and probabilistic graphical models
I. Haasler, R. Singh, Q. Zhang, J. Karlsson, and Y. Chen · 2021
Closest in time.
Extremal probability bounds in combinatorial optimization
D. Padmanabhan, S. Damla Ahipasaoglu, A. Ramachandra, and K. Natarajan · 2021
Closest in time.
Wasserstein barycenters are NP-hard to compute
J. M. Altschuler and E. Boix-Adserà · 2022
Closest in time.
Near-linear convergence of the Random Osborne algorithm for Matrix Balancing
J. M. Altschuler and P. A. Parrilo · 2022
Closest in time.
Distributionally robust linear and discrete optimization with marginals
L. Chen, W. Ma, K. Natarajan, D. Simchi-Levi, and Z. Yan · 2022
Closest in time.