Parameterized Algorithms for Constraint Satisfaction Problems Above Average with Global Cardinality Constraints
Work
Year: 2017
Type: preprint
Abstract: Given a constraint satisfaction problem (CSP) on n variables, x1,x2,…, xn ∊ {±1}, and m constraints, aglobal cardinality constraint has the form of where p ∊ (Ω(1), 1 - Ω(1)) and pn is an integer. Let... more
Cites: 44
Cited by:
Related to: 10
Citation percentile (by year/subfield):
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze