Abstract
Given a constraint satisfaction problem (CSP) on n variables, x1, x2, . . . , xn ∈ {±1}, and m constraints, a global cardinality constraint has the form of Σni = 1xi = (1 − 2p)n, where p ∈ (Ω(1), 1 − Ω(1)) and pn is an integer. Let AV G be the expected number of constraints satisfied by randomly choosing an assignment to x1, x2, . . . , xn, complying with the global cardinality constraint. The CSP above average with the global cardinality constraint problem asks whether there is an assignment (complying with the cardinality constraint) that satisfies more than (AV G + t) constraints, where t is an input parameter.In this paper, we present an algorithm that finds a valid assignment satisfying more than (AV G + t) constraints (if there exists one) in time (2o(t2) + no(d)). Therefore, the CSP above average with the global cardinality constraint problem is fixed-parameter tractable.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.