(2021) Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth.

Text
LIPIcsICALP202195.pdf  Published Version Available under License Creative Commons Attribution. Download (1MB)  Preview 
Abstract
In the General Factor problem, we are given an undirected graph G and for each vertex v ∈ V(G) a finite set B_v of nonnegative integers. The task is to decide if there is a subset S ⊆ E(G) such that deg_S(v) ∈ B_v for all vertices v of G. Define the maxgap of a finite integer set B to be the largest d ≥ 0 such that there is an a ≥ 0 with [a,a+d+1] ∩ B = {a,a+d+1}. Cornuéjols showed in 1988 that if the maxgap of all sets B_v is at most 1, then the decision version of General Factor is polynomialtime solvable. This result was extended 2018 by Dudycz and Paluch for the optimization (i.e. minimization and maximization) versions. We present a general algorithm counting the number of solutions of a certain size in time (M+1)^{tw}n^{O(1)}, given a tree decomposition of width tw, where M is the maximum integer over all B_v. By using convolution techniques from van Rooij (2020), we improve upon the previous (M+1)^{3tw}n^{O(1)} time algorithm by Arulselvan et al. from 2018. We prove that this algorithm is essentially optimal for all cases that are not trivial or polynomial time solvable for the decision, minimization or maximization versions. Our lower bounds show that such an improvement is not even possible for BFactor, which is General Factor on graphs where all sets B_v agree with the fixed set B. We show that for every fixed B where the problem is NPhard, our (max B+1)^{tw}n^{O(1)} algorithm cannot be significantly improved: assuming the Strong Exponential Time Hypothesis (SETH), no algorithm can solve BFactor in time (max B+1ε)^{tw}n^{O(1)} for any ε > 0. We extend this bound to the counting version of BFactor for arbitrary, nontrivial sets B, assuming #SETH. We also investigate the parameterization of the problem by cutwidth. Unlike for treewidth, having a larger set B does not appear to make the problem harder: we give a 2^{cutw}n^{O(1)} algorithm for any B and provide a matching lower bound that this is optimal for the NPhard cases.
Item Type:  Conference or Workshop Item (A Paper) (Paper) 

Divisions:  Dániel Marx (DM) 
Conference:  ICALP International Colloquium on Automata Languages and Programming 
Depositing User:  Philipp Schepper 
Date Deposited:  14 Jul 2021 09:38 
Last Modified:  13 Oct 2022 09:01 
Primary Research Area:  NRA1: Trustworthy Information Processing 
URI:  https://publications.cispa.saarland/id/eprint/3445 
Actions
Actions (login required)
View Item 