Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2510.00331

One-Sided Local Crossing Minimization

Panos Giannopoulos·Miriam Goetze·Grzegorz Gutowski·Maarten Löffler·Martin Nöllenburg·Yuto Okada·Jonathan Rollin·Birgit Vogtenhuber·Alexander Wolff
View original source ↗Read source document ↗Export metadata ↓

Abstract

Drawing graphs with the minimum number of crossings is a classical problem that has been studied extensively. Many restricted versions of the problem have been considered. For example, bipartite graphs can be drawn such that the two sets in the bipartition of the vertex set are mapped to two parallel lines, and the edges are drawn as straight-line segments. In this setting, the number of crossings depends only on the ordering of the vertices on the two lines. Two natural variants of the problem have been studied. In the one-sided case, the order of the vertices on one of the two lines is given and fixed; in the two-sided case, no order is given. Both cases are important yet NP-hard subproblems in the so-called Sugiyama framework for drawing layered graphs with few crossings. For the one-sided case, Eades and Wormald [Algorithmica 1994] introduced a median heuristic and showed that it has an approximation ratio of 3. In recent years, researchers have focused on a local version of crossing minimization, where the aim is to minimize the maximum number of crossings per edge instead of the total number of crossings. Kobayashi, Okada, and Wolff [SoCG 2025] investigated the complexity of local crossing minimization parameterized by the natural parameter. They conjectured that one-sided local crossing minimization is NP-hard. In this work, we confirm their conjecture by showing that the problem is NP-hard even for forests of high-degree stars. In fact, more strongly, the reduction yields a tight lower bound, which excludes the existence of subexponential-time algorithms assuming the Exponential-Time Hypothesis. In contrast, we present a quadratic-time algorithm for the special case of forests of stars of maximum degree 2. Finally, we provide a median heuristic with a carefully designed tie-breaking scheme and prove that it has an approximation ratio of 3 in the local setting.

Explore related subjects

cs.DS

Keep this discovery

BibTeXRIS

Panos Giannopoulos, Miriam Goetze, Grzegorz Gutowski, Maarten Löffler, Martin Nöllenburg, Yuto Okada, Jonathan Rollin, Birgit Vogtenhuber, Alexander Wolff. 2025-09-30. One-Sided Local Crossing Minimization. https://arxiv.org/abs/2510.00331

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

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↗