Browse by author
Lookup NU author(s): Dr Konrad DabrowskiORCiD
This work is licensed under a Creative Commons Attribution 4.0 International License (CC BY 4.0).
Checking whether a system of linear equations is consistent is a basic computational problem with ubiquitous applications. When dealing with inconsistent systems, one may seek an assignment that minimises the number of unsatisfied equations. This problem is NP-hard and UGC-hard to approximate within any constant even for two-variable equations over the two-element field. We study this problem from the point of view of parameterized complexity, with the parameter being the number of unsatisfied equations. We consider equations defined over a family of commutative domains (i.e. rings without zero divisors) with a particular Helly property. This set contains, for instance, finite and infinite fields, the ring of integers and univariate polynomial rings with coefficients from a field; more generally, it contains the important class of Prüfer domains. We show that if every equation contains at most two variables, the problem is fixed-parameter tractable. This generalises many eminent graph separation problems such as Bipartization, Multiway Cut and Multicut parameterized by the size of the cutset. To complement this, we show that the problem is W[1]-hard when three or more variables are allowed in an equation, as well as for many commutative rings that are not covered by our fpt result. On the technical side, we introduce the notion of important balanced subgraphs, generalising the important separators of Marx to the setting of biased graphs. Furthermore, we use recent results of Kim, Kratsch, Pilipczuk and Wahlström on parameterized MinCSP to efficiently solve a generalisation of Multicut with disjunctive cut requests.
Author(s): Dabrowski KK, Jonsson P, Ordyniak S, Osipov G, Wahlström M
Publication type: Article
Publication status: Published
Journal: ACM Transactions on Algorithms
Year: 2025
Volume: 21
Issue: 4
Pages: 1-55
Online publication date: 09/05/2025
Acceptance date: 03/01/2025
Date deposited: 03/04/2025
ISSN (print): 1549-6325
ISSN (electronic): 1549-6333
Publisher: ACM
URL: https://doi.org/10.1145/3733107
DOI: 10.1145/3733107
ePrints DOI: 10.57711/t6as-x254
Altmetrics provided by Altmetric
