Effectiveness of structural restrictions for hybrid CSPs

V. Kolmogorov, M. Rolinek, R. Takhanov, 9472 (2015) 566–577.


Conference Paper | Published | English
Department
Series Title
LNCS
Abstract
Constraint Satisfaction Problem (CSP) is a fundamental algorithmic problem that appears in many areas of Computer Science. It can be equivalently stated as computing a homomorphism R→ΓΓ between two relational structures, e.g. between two directed graphs. Analyzing its complexity has been a prominent research direction, especially for the fixed template CSPs where the right side ΓΓ is fixed and the left side R is unconstrained. Far fewer results are known for the hybrid setting that restricts both sides simultaneously. It assumes that R belongs to a certain class of relational structures (called a structural restriction in this paper). We study which structural restrictions are effective, i.e. there exists a fixed template ΓΓ (from a certain class of languages) for which the problem is tractable when R is restricted, and NP-hard otherwise. We provide a characterization for structural restrictions that are closed under inverse homomorphisms. The criterion is based on the chromatic number of a relational structure defined in this paper; it generalizes the standard chromatic number of a graph. As our main tool, we use the algebraic machinery developed for fixed template CSPs. To apply it to our case, we introduce a new construction called a “lifted language”. We also give a characterization for structural restrictions corresponding to minor-closed families of graphs, extend results to certain Valued CSPs (namely conservative valued languages), and state implications for (valued) CSPs with ordered variables and for the maximum weight independent set problem on some restricted families of graphs.
Publishing Year
Date Published
2015-12-01
Volume
9472
Page
566 - 577
Conference
ISAAC: International Symposium on Algorithms and Computation
Conference Location
Nagoya, Japan
Conference Date
2015-12-09 – 2015-12-11
IST-REx-ID

Cite this

Kolmogorov V, Rolinek M, Takhanov R. Effectiveness of structural restrictions for hybrid CSPs. 2015;9472:566-577. doi:10.1007/978-3-662-48971-0_48
Kolmogorov, V., Rolinek, M., & Takhanov, R. (2015). Effectiveness of structural restrictions for hybrid CSPs. Presented at the ISAAC: International Symposium on Algorithms and Computation, Nagoya, Japan: Springer. https://doi.org/10.1007/978-3-662-48971-0_48
Kolmogorov, Vladimir, Michal Rolinek, and Rustem Takhanov. “Effectiveness of Structural Restrictions for Hybrid CSPs.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-48971-0_48.
V. Kolmogorov, M. Rolinek, and R. Takhanov, “Effectiveness of structural restrictions for hybrid CSPs,” vol. 9472. Springer, pp. 566–577, 2015.
Kolmogorov V, Rolinek M, Takhanov R. 2015. Effectiveness of structural restrictions for hybrid CSPs. 9472, 566–577.
Kolmogorov, Vladimir, et al. Effectiveness of Structural Restrictions for Hybrid CSPs. Vol. 9472, Springer, 2015, pp. 566–77, doi:10.1007/978-3-662-48971-0_48.

Link(s) to Main File(s)
Access Level
OA Open Access

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar