Point-width and Max-CSPs
<p>The complexity of (unbounded-arity) Max-CSPs under structural restrictions is poorly understood. The two most general hypergraph properties known to ensure tractability of Max-CSPs, β-acyclicity and bounded (incidence) MIM-width, are incomparable and lead to very different algorithms.</p...
主要な著者: | Carbonnel, C, Romero, M, Živný, S |
---|---|
フォーマット: | Journal article |
言語: | English |
出版事項: |
Association for Computing Machinery
2020
|
類似資料
-
Point-width and max-CSPs
著者:: Carbonnel, C, 等
出版事項: (2019) -
Pliability and approximating max-CSPs
著者:: Romero, M, 等
出版事項: (2023) -
Treewidth-pliability and PTAS for Max-CSPs
著者:: Romero, M, 等
出版事項: (2021) -
The complexity of general-valued CSPs seen from the other side
著者:: Carbonnel, C, 等
出版事項: (2018) -
On singleton arc consistency for CSPs defined by monotone patterns
著者:: Carbonnel, C, 等
出版事項: (2018)