P. Jonsson
The approximability of three-valued Max CSP.
Jonsson, P.; Klasson, M.; Krokhin, A.
Citation
Jonsson, P., Klasson, M., & Krokhin, A. (2006). The approximability of three-valued Max CSP. SIAM Journal on Computing, 35, 1329-1349
Journal Article Type | Article |
---|---|
Publication Date | 2006 |
Journal | SIAM Journal on Computing |
Print ISSN | 0097-5397 |
Electronic ISSN | 1095-7111 |
Publisher | Society for Industrial and Applied Mathematics |
Volume | 35 |
Pages | 1329-1349 |
Public URL | https://durham-repository.worktribe.com/output/1589225 |
You might also like
Topology and adjunction in promise constraint satisfaction
(2023)
Journal Article
Algebraic Approach to Promise Constraint Satisfaction
(2021)
Journal Article
Robust algorithms with polynomial loss for near-unanimity CSPs
(2019)
Journal Article
Towards a characterization of constant-factor approximable Finite-Valued CSPs
(2018)
Journal Article