Phylogenetic CSPs are Approximation Resistant.
Vaggos ChatziafratisKonstantin MakarychevPublished in: CoRR (2022)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- approximation algorithms
- error bounds
- closed form
- approximation error
- arc consistency
- relative error
- constraint networks
- approximation methods
- phylogenetic trees
- constraint propagation
- non binary
- search space
- continuous functions
- approximation schemes
- hypertree decomposition