Approximation Algorithms for 1-Wasserstein Distance Between Persistence Diagrams.
Samantha ChenYusu WangPublished in: SEA (2021)
Keyphrases
- approximation algorithms
- special case
- np hard
- worst case
- vertex cover
- facility location problem
- network design problem
- minimum cost
- set cover
- open shop
- np hardness
- approximation ratio
- longest common subsequence
- constant factor
- randomized algorithms
- exact algorithms
- pointwise
- primal dual
- undirected graph
- distance measure
- approximation schemes
- precedence constraints
- distance function