V. Deineko
Supermodularity on chains and complexity of maximum constraint satisfaction
Deineko, V.; Jonsson, P.; Klasson, M.; Krokhin, A.
Authors
Contributors
S. Felsner
Editor
Citation
Deineko, V., Jonsson, P., Klasson, M., & Krokhin, A. (2005, December). Supermodularity on chains and complexity of maximum constraint satisfaction. Presented at 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb'05)
| Presentation Conference Type | Conference Paper (published) |
|---|---|
| Conference Name | 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb'05) |
| Publication Date | 2005 |
| Volume | AE |
| Pages | 51-56 |
| Series Title | DMTCS Proceedings |
| Public URL | https://durham-repository.worktribe.com/output/1163233 |
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
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search