Related papers: On the $k$-Hamming and $k$-Edit Distances

We present a packing-based approximation algorithm for the $k$-Set Cover problem. We introduce a new local search-based $k$-set packing heuristic, and call it Restricted $k$-Set Packing. We analyze its tight approximation ratio via a…

This short technical note presents a formal generalization of the Time Warp Edit Distance (TWED) proposed by Marteau (2009) to arbitrary metric spaces. By viewing both the observation and temporal domains as metric spaces $(X, d)$ and $(T,…

Deciding whether a graph can be edge-decomposed into a matching and a $k$-bounded linear forest was recently shown by Campbell, H{\"o}rsch and Moore to be NP-complete for every $k \ge 9$, and solvable in polynomial time for $k=1,2$. In the…

The $k$-cut problem asks, given a connected graph $G$ and a positive integer $k$, to find a minimum-weight set of edges whose removal splits $G$ into $k$ connected components. We give the first polynomial-time algorithm with approximation…

We prove a generalization of a result of Peres and Schlag on the dimensions of certain exceptional sets of projections and then apply it to a geometric problem.

Addressing questions raised in recent papers, we study the $r$-distance graph $H_r(n)$ on the Boolean cube $\{0,1\}^n$, where two vertices are adjacent if their Hamming distance is exactly $r$. For fixed integers $s \ge 2$ and even $r \ge…

This paper is concerned with algebraic geometry over complete discretely valued fields $K$ of equicharacteristic zero. Several results are given including: the canonical projection $K^{n} \times K\mathbb{P}^{m} \longrightarrow K^{n}$ and…

In this paper we consider the $p$-Norm Hamming Centroid problem which asks to determine whether some given binary strings have a centroid with a bound on the $p$-norm of its Hamming distances to the strings. Specifically, given a set of…

This work is focused on the study of the nonlinear elliptic higher order equation \begin{equation}\nonumber \left( -\Delta \right)^m u = S_k[-u] + \lambda f, \qquad x \in \mathbb{R}^N, \end{equation} where the $k-$Hessian $S_k[u]$ is the…

We prove that the commutator is stable in permutations endowed with the Hamming distance, that is, two permutations that almost commute are near two commuting permutations. Our result extends to $k$-tuples of almost commuting permutations,…

The edit distance between two strings is defined as the smallest number of insertions, deletions, and substitutions that need to be made to transform one of the strings to another one. Approximating edit distance in subquadratic time is…

We show that the simplest local search heuristics for two natural Euclidean clustering problems are PLS-complete. First, we show that the Hartigan--Wong method for $k$-Means clustering is PLS-complete, even when $k = 2$. Second, we show the…

This paper is devoted to Markov's extremal problems of the form $M_{n,k}=\sup_{p\in\PP_n\setminus\{0\}}{{\|p^{(k)}\|}_X}/{{\|p\|}_X}$ $(1\le k\le n)$, where $\PP_n$ is the set of all algebraic polynomials of degree at most $n$ and $X$ is a…

Etzion et al. introduced metrics on $\mathbb{F}_2^n$ based on directed graphs on $n$ vertices and developed some basic coding theory on directed graph metric spaces. In this paper, we consider the problem of classifying directed graphs…

For any $\varepsilon > 0$, we prove that $k$-Dimensional Matching is hard to approximate within a factor of $k/(12 + \varepsilon)$ for large $k$ unless $\textsf{NP} \subseteq \textsf{BPP}$. Listed in Karp's 21 $\textsf{NP}$-complete…

We prove that certain problems naturally arising in knot theory are NP--hard or NP--complete. These are the problems of obtaining one diagram from another one of a link in a bounded number of Reidemeister moves, determining whether a link…

The Regular Post Embedding Problem extended with partial (co)directness is shown decidable. This extends to universal and/or counting versions. It is also shown that combining directness and codirectness in Post Embedding problems leads to…

We prove results on the decidability and complexity of computing the total variation distance (equivalently, the $L_1$-distance) of hidden Markov models (equivalently, labelled Markov chains). This distance measures the difference between…

Using a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to…

We investigate the computational complexity of computing the Hausdorff distance. Specifically, we show that the decision problem of whether the Hausdorff distance of two semi-algebraic sets is bounded by a given threshold is complete for…