On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP.
Karthik C. S.Euiwoong LeePasin ManurangsiPublished in: CoRR (2024)
Keyphrases
- constraint satisfaction problems
- approximation algorithms
- constraint satisfaction
- ordering heuristics
- maintaining arc consistency
- decomposition methods
- median filter
- state space
- np hard
- special case
- constraint propagation
- search space
- soft constraints
- bayesian networks
- constraint solving
- aggregation functions
- neural network
- tree decompositions
- real time