Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1810.00529

Minimum-Link Rectilinear Covering Tour is NP-hard in $R^{4}$

Bhadrachalam Chitturi·Jayakumar Pai
View original source ↗Read source document ↗Export metadata ↓

Abstract

Given a set $P$ of $n$ points in $R^{d}$, a tour is a closed simple path that covers all the given points, i.e. a Hamiltonian cycle. % In $P$ if no three points are collinear then the points are said to be in general position. A \textit{link} is a line segment connecting two points and a rectilinear link is parallel to one of the axes. The problems of defining a path and a tour with minimum number of links, also known as Minimum-Link Covering Path and Minimum-Link Covering Tour respectively are proven to be NP-hard in $R^2$. The corresponding rectilinear versions are also NP-hard in $R^2$. A set of points is said to be in \textit{general position} for rectilinear versions of the problems if no two points share any coordinate. We call a set of points in $R^{d}$ to be in \textit{relaxed general position} if no three points share any coordinate and any two points can share at most one coordinate. That is, if the points are either in general position or in relaxed general position then an axis parallel line can contain at most one point. If points are in relaxed general position then these problems are NP-hard in $R^{10}$. We prove that these two problems are in fact NP-hard in $R^{4}$. If points in $R^{d},~d>1$ are in general position then the time complexities of these problems, both basic and rectilinear versions, are unknown.

Explore related subjects

cs.CC

Keep this discovery

BibTeXRIS

Bhadrachalam Chitturi, Jayakumar Pai. 2018-10-01. Minimum-Link Rectilinear Covering Tour is NP-hard in $R^{4}$. https://arxiv.org/abs/1810.00529

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

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗
arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗