Hardness and algorithmic results for the approximate cover problem

Alexandru Popa; Andrei Tanasescu

Home/Archive/arXiv

arXiv · 1806.08135

Hardness and algorithmic results for the approximate cover problem

Alexandru Popa·Andrei Tanasescu

View original source ↗Read source document ↗Export metadata ↓

Abstract

In CPM 2017, Amir et al. introduce a problem, named \emph{approximate string cover} (\textbf{ACP}), motivated by many aplications including coding and automata theory, formal language theory, combinatorics and molecular biology. A \emph{cover} of a string $T$ is a string $C$ for which every letter of $T$ lies within some occurrence of $C$. The input of the \textbf{ACP} problem consists of a string $T$ and an integer $m$ (less than the length of $T$), and the goal is to find a string $C$ of length $m$ that covers a string $T'$ which is as close to $T$ as possible (under some predefined distance). Amir et al. study the problem for the Hamming distance. In this paper we continue the work of Amir et al. and show the following results: We show an approximation algorithm for the \textbf{ACP} with an approximation ratio of $\sqrt{OPT}$, where OPT is the size of the optimal solution. We provide an FPT algorithm with respect to the alphabet size. \item The \textbf{ACP} problem naturally extends to pseudometrics. Moreover, we show that for some family of pseudometrics, that we term \emph{homogenous additive pseudometrics}, the complexity of \textbf{ACP} remains unchanged. We partially give an answer to an open problem of Amir et al. and show that the Hamming distance over an unbounded alphabet is equivalent to an extended metric over a fixed sized alphabet.

Explore related subjects

cs.DS

Keep this discovery

BibTeX RIS

Alexandru Popa, Andrei Tanasescu. 2018-06-21. Hardness and algorithmic results for the approximate cover problem. https://arxiv.org/abs/1806.08135

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↗