Similar Items: Discrete Optimal Transport: Rapid Convergence of Simulated Annealing Algorithms
- An Optimal Algorithm for Cardinality-Constrained Diameter Partitioning
- Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs
- Faster Mixing for Triangulations via Transport Flows
- The Impact of Approximation on Algorithmic Progress
- Succinct Graph Representations and Algorithmic Applications
- Exact and Approximate Algorithms for Polytree Learning