Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.23130

Online geometric matching and segments block points

Yaqiao Li·Junyi Lin
View original source ↗Read source document ↗Export metadata ↓

Abstract

Given a sequence of online points in general position in the plane, the geometric matching problem asks to match as many points as possible, subject to segment crossing constraints. We initiate the study of online geometric matching with limited crosses. In the $k$-crossing model each matched segment is allowed to have at most $k$ crosses, where $k=0$ corresponds to the online noncrossing matching model for which Bose et al. proved that Greedy is an optimal deterministic algorithm achieving a competitive ratio of $2/3$. In the triangle-free-crossing model no three matched segments are allowed to pairwise cross each other. Interestingly, we show in both cases the performance of Greedy does not improve by allowing crosses, and in fact, becomes worse in the $k$-crossing setting for $k\ge 1$. In the triangle-free-crossing model, we propose a simple two-layer-Greedy deterministic algorithm achieving a competitive ratio $4/5$. More interestingly, we propose and study the underlying segments blocking points extremal problem, and discuss its connection to vertex cover numbers and Ramsey numbers, with interesting open problems that might be of independent interest. We revisit the noncrossing model. We give a randomized algorithm which is an asymmetric version of Kamali et al., improving the competitive ratio from $0.66952$ to $0.67034$. We also show, via a conceptually simple construction, that no randomized algorithm can match more than $6/7$ fraction of points, improving the previous $16/17$ by Boyar et al.

Explore related subjects

cs.DScs.CG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yaqiao Li, Junyi Lin. 2026-10-16. Online geometric matching and segments block points. https://arxiv.org/abs/2610.23130

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

KEEP EXPLORING

Related papers

arXiv2026

Breaking the $2^n$ barrier for directed hamiltonicity

We give a randomized algorithm for Directed Hamiltonian Cycle on $n$-vertex directed graphs that runs in $O^*(1.9133^n)$ time. For general directed graphs, this is the first improvement in the exponential base over the classical $O(2^n n^2)$-time algorithms of Bellman and Held--Karp (1962). To obtain this improvement, we reduce Hamiltonicity to weighted parity counting using the isolation lemma of Mulmuley, Vazirani, and Vazirani (STOC 1987). If a Hamiltonian path from $s$ to $t$ exists, assigning random polynomially bounded integer weights to the arcs gives a unique minimum-weight Hamiltonian path from $s$ to $t$ with constant probability. In particular, the path count at its total weight is odd. To compute these parities, we give a $(2-2^{-d})^n n^{O(1)}$-time algorithm for instances in which the arcs entering each vertex have at most $d$ distinct polynomially bounded integer weights. The algorithm applies the random linearization idea of Arvind and Guruswami (IPEC 2021) to the Laplacian determinant construction of Björklund, Kaski, and Koutis (ICALP 2017). To keep $d$ small, we randomly delete and duplicate arcs and partition the incoming copies at each vertex into $d$ groups, assigning a common weight to all arcs in each group. We prove that, if the input graph has a Hamiltonian path from $s$ to $t$, then with positive, albeit exponentially small, probability one can select one group at each vertex so that their union contains an odd number of such paths.

cs.DS↗
arXiv2026

A deterministic polynomial-time algorithm for the Bilu--Linial signing problem on bipartite graphs

We give a deterministic polynomial-time algorithm for the Bilu--Linial signing problem on bipartite graphs. For every finite simple bipartite graph of maximum degree at most an integer $Δ\ge3$, the algorithm assigns signs to its edges so that the signed adjacency matrix has operator norm strictly less than $2\sqrt{Δ-1}$. Our algorithm builds on the randomized recursive repair framework of Jadbabaie, Saberi, and Sra~\cite{JSS26}, with deterministic rules for sign selection and vertex deletion.

cs.DS↗
arXiv2026

Inclusion-wise extremal knapsack problems are (mostly) hard to approximate

We study two inclusion-wise extremal variants of the 0-1 Knapsack Problem (KP). Given $n$ items with integer weights and nonnegative costs or profits, the Minimum-Cost Maximal Knapsack Packing Problem seeks a minimum-cost packing for capacity $c$ to which no item can be added, while the Maximum-Profit Minimal Knapsack Cover Problem seeks a maximum-profit cover for threshold $d$ from which no item can be removed. Both problems are weakly $\mathrm{NP}$-hard and pseudo-polynomially solvable, as is the classical KP, but their approximability is fundamentally different: unless $\mathrm{P}=\mathrm{NP}$, with positive values neither problem admits a polynomial-time $2^{p(n)}$-approximation for any polynomial $p$; allowing zero values rules out every multiplicative factor. Even with unit costs for packing and unit profits for covering, neither admits an $n^{1-\varepsilon}$-approximation for any fixed $\varepsilon>0$, whereas a trivial $n$-approximation exists. We identify restrictions that restore approximability. If every item weighs at least a fixed fraction of the capacity, respectively of the threshold, both problems can be solved exactly in polynomial time. For the cover problem, if each weight $w_i$ satisfies $w_i-1\geδ(d-1)$, we give an approximation scheme for arbitrary profits whose running time is polynomial in $n$, $1/\varepsilon$, and $1/δ$. If values equal weights, a fully polynomial-time approximation scheme (FPTAS) was already known for the packing problem; we give an FPTAS for the cover problem, improving on the previously known factor $2$. If value-to-weight ratios differ by at most a factor $κ$, we obtain a $(1+\varepsilon)κ$-approximation for both problems.

cs.DS↗