A tight Monte-Carlo algorithm for Steiner Tree parameterized by clique-width

07/26/2023
by   Narek Bojikian, et al.
0

Recently, Hegerfeld and Kratsch [ESA 2023] obtained the first tight algorithmic results for hard connectivity problems parameterized by clique-width. Concretely, they gave one-sided error Monte-Carlo algorithms that given a k-clique-expression solve Connected Vertex Cover in time 6^kn^O(1) and Connected Dominating Set in time 5^kn^O(1). Moreover, under the Strong Exponential-Time Hypothesis (SETH) these results were showed to be tight. However, they leave open several important benchmark problems, whose complexity relative to treewidth had been settled by Cygan et al. [SODA 2011 TALG 2018]. Among which is the Steiner Tree problem. As a key obstruction they point out the exponential gap between the rank of certain compatibility matrices, which is often used for algorithms, and the largest triangular submatrix therein, which is essential for current lower bound methods. Concretely, for Steiner Tree the GF(2)-rank is 4^k, while no triangular submatrix larger than 3^k was known. This yields time 4^kn^O(1), while the obtainable impossibility of time (3-ε)^kn^O(1) under SETH was already known relative to pathwidth. We close this gap by showing that Steiner Tree can be solved in time 3^kn^O(1) given a k-clique-expression. Hence, for all parameters between cutwidth and clique-width it has the same tight complexity. We first show that there is a “representative submatrix” of GF(2)-rank 3^k (ruling out larger triangular submatrices). At first glance, this only allows to count (modulo 2) the number of representations of valid solutions, but not the number of solutions (even if a unique solution exists). We show how to overcome this problem by isolating a unique representative of a unique solution, if one exists. We believe that our approach will be instrumental for settling further open problems in this research program.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/07/2023

Tight algorithms for connectivity problems parameterized by clique-width

The complexity of problems involving global constraints is usually much ...
research
07/10/2023

Tight Algorithmic Applications of Clique-Width Generalizations

In this work, we study two natural generalizations of clique-width intro...
research
02/27/2023

Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth

We study connectivity problems from a fine-grained parameterized perspec...
research
07/12/2017

Fast exact algorithms for some connectivity problems parametrized by clique-width

Given a clique-width expression of a graph G of clique-width k, we provi...
research
05/29/2018

Rank Based Approach on Graphs with Structured Neighborhood

In this paper, we combine the rank-based approach and the neighbor-equiv...
research
02/27/2022

A logic-based algorithmic meta-theorem for mim-width

We introduce a logic called distance neighborhood logic with acyclicity ...
research
04/24/2020

Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds

We prove that the Hadwiger number of an n-vertex graph G (the maximum si...

Please sign up or login with your details

Forgot password? Click here to reset