Approximation algorithms for 1-Wasserstein distance between persistence diagrams.
Samantha ChenYusu WangPublished in: CoRR (2021)
Keyphrases
- approximation algorithms
- special case
- np hard
- vertex cover
- minimum cost
- worst case
- facility location problem
- distance measure
- primal dual
- network design problem
- precedence constraints
- polynomial time approximation
- set cover
- exact algorithms
- np hardness
- constant factor
- randomized algorithms
- longest common subsequence
- open shop
- approximation schemes
- constant factor approximation
- pointwise
- combinatorial auctions
- similarity measure
- theoretical analysis
- scheduling problem
- disjoint paths