On the Parameterized Approximability of Contraction to Classes of Chordal Graphs

Spoorthy Gunda; Pallavi Jain; Daniel Lokshtanov; Saket Saurabh; Prafullkumar Tale

Home/Archive/arXiv

arXiv · 2006.10364

On the Parameterized Approximability of Contraction to Classes of Chordal Graphs

Spoorthy Gunda·Pallavi Jain·Daniel Lokshtanov·Saket Saurabh·Prafullkumar Tale

View original source ↗Read source document ↗Export metadata ↓

Abstract

A graph operation that {\em contracts edges} is one of the fundamental operations in the theory of graph minors. Parameterized Complexity of editing to a family of graphs by contracting $k$ edges has recently gained substantial scientific attention, and several new results have been obtained. Some important families of graphs, namely the subfamilies of chordal graphs, in the context of edge contractions, have proven to be significantly difficult than one might expect. In this paper, we study the \textsc{$\cal F$-Contraction} problem, where $\cal F$ is a subfamily of chordal graphs, in the realm of parameterized approximation. Formally, given a graph $G$ and an integer $k$, \textsc{ $\cal F$-Contraction} asks whether there exists $X \subseteq E(G)$ such that $G/X \in \cal F$ and $|X| \leq k$. Here, $G/X$ is the graph obtained from $G$ by contracting edges in $X$. We obtain the following results for the \textsc{ $\cal F$-Contraction} problem. $(1)$ We show that \textsc{Clique Contraction} admits a polynomial-size approximate kernelization scheme (\textsf{PSAKS}). $(2)$ We give a $(2+\epsilon)$-approximate polynomial kernel for \textsc{Split Contraction} (which also implies a factor $(2+\epsilon)$-\FPT-approximation algorithm for \textsc{ Split Contraction}). Furthermore, we show that, assuming \textsf{ Gap-ETH}, there is no $\left(\frac{5}{4}-\delta \right)$-\FPT-approximation algorithm for \textsc{Split Contraction}. Here, $\epsilon, \delta>0$ are fixed constants. $(3)$ \textsc{Chordal Contraction} is known to be \WTH. We complement this result by observing that the existing \textsf{W[2]-hardness} reduction can be adapted to show that, assuming \FPT $\neq$ \textsf{W[1]}, there is no $F(k)$-\FPT-approximation algorithm for \textsc{Chordal Contraction}. Here, $F(k)$ is an arbitrary function depending on $k$ alone.

Explore related subjects

cs.DS

Keep this discovery

BibTeX RIS

Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh, Prafullkumar Tale. 2020-06-18. On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. https://arxiv.org/abs/2006.10364

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗

arXiv2026

A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix

For every fixed $0<\varepsilon\le1$, we give a deterministic strongly polynomial algorithm that, given a nonnegative matrix $A\in\mathbb{R}_{\ge0}^{n\times n}$, returns $Q$ satisfying $\operatorname{per} A\le Q\le(1+\varepsilon)^n\operatorname{per} A$.

cs.DS↗

arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗