Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2602.07927

Multipacking on graphs and Euclidean metric space

Sk Samim Islam
View original source ↗Read source document ↗Export metadata ↓

Abstract

A \emph{multipacking} in an undirected graph $G=(V,E)$ is a set $M\subseteq V$ such that for every vertex $v\in V$ and for every integer $r\geq 1$, the ball of radius $ r $ around $ v $ contains at most $r$ vertices of $M$. The \textsc{Multipacking} problem asks whether a graph contains a multipacking of size at least $k$. For more than a decade, it remained open whether \textsc{Multipacking} is \textsc{NP-complete} or polynomial-time solvable, although it is known to be polynomial-time solvable for some classes (e.g., strongly chordal graphs and grids). Foucaud, Gras, Perez, and Sikora [\textit{Algorithmica} 2021] showed it is \textsc{NP-complete} for directed graphs and \textsc{W[1]-hard} when parameterized by the solution size. We resolve the open question by proving \textsc{Multipacking} is \textsc{NP-complete} for undirected graphs and \textsc{W[2]-hard} when parameterized by the solution size. Furthermore, we show it remains \textsc{NP-complete} and \textsc{W[2]-hard} even for chordal, bipartite, claw-free, regular, CONV, and chordal$\cap\frac{1}{2}$-hyperbolic graphs (a superclass of strongly chordal graphs), and we provide approximation algorithms for cactus, chordal, and $\delta$-hyperbolic graphs. Moreover, we study the relationship between multipacking number and broadcast domination number for cactus, chordal, and $\delta$-hyperbolic graphs. Further, we prove that for all $r\geq 2$, \textsc{$r$-Multipacking} is \textsc{NP-complete} even for planar bipartite graphs with bounded degree, and also for bounded-diameter chordal and bounded-diameter bipartite graphs. For geometric variants, in $\mathbb{R}^2$ a maximum $1$-multipacking can be computed in polynomial time, but computing a maximum $2$-multipacking is \textsc{NP-hard}, and we provide approximation and parameterized algorithms for the $2$-multipacking problem.

Explore related subjects

cs.DM

Keep this discovery

BibTeXRIS

Sk Samim Islam. 2026-02-08. Multipacking on graphs and Euclidean metric space. https://arxiv.org/abs/2602.07927

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

KEEP EXPLORING

Related papers

arXiv2026

An FPTAS for Two-Machine Open-Shop Scheduling with a Single Unavailability Interval

We consider the two-machine open-shop scheduling problem in which one machine is unavailable during a fixed interval. We study the resumable setting: an operation interrupted by the unavailability interval may resume, without penalty, when the machine becomes available. The objective is to minimize the makespan. Although the problem is NP-hard and several approximation algorithms are known, whether it admits a fully polynomial-time approximation scheme (FPTAS) has remained open for two decades. We resolve this question affirmatively by giving the first FPTAS, thereby strengthening the previously known polynomial-time approximation scheme (PTAS). As an intermediate result, we develop a new pseudo-polynomial dynamic program with seven state dimensions, improving on the ten-dimensional formulation in the literature.

cs.DM↗
arXiv2026

Generalized Graph Search Trees

Graph search algorithms and their corresponding graph search trees are commonly used in algorithmic graph theory. In recent years, the recognition problem of these graph search trees has received significant attention. So far, the research has focused on two types of search trees: first-in trees that behave like BFS-trees and last-in trees that behave like DFS-trees. The search tree paradigms differ from each other by the parent a vertex is connected to. In first-in trees, it is the first visited neighbor, while in last-in trees it is the last neighbor visited before that vertex. Here, we will generalize these concepts of graph search trees by allowing every preceding neighbor of a vertex to be the parent. We study the complexity of the recognition problem of these generalized graph search trees. We present NP-completeness proofs for most searches. We also show that the problem is trivial for Generic Search and polynomial-time solvable for several searches on bipartite graphs and chordal graphs. We also study the question how fixing the start vertex influences the complexity of the problem.

cs.DM↗
arXiv2026

The exact asymptotic constant in the metric dimension of Jaccard space

Let $X$ be a finite set with $|X|=n$ and let $\mathrm{Jac}(a,b)=|a\,\triangle\, b|/|a\cup b|$ be the Jaccard distance on the power set $2^X$. Lladser and Paradise recently proved that the metric dimension of $(2^X,\mathrm{Jac})$ is $\Theta(n/\ln n)$, with the constant left open; their bounds are $(\ln 2)\,n/\ln n\lesssim \beta(2^X,\mathrm{Jac})\lesssim 2\ln(2e)\,n/\ln n$. We determine the constant: \[ \beta(2^X,\mathrm{Jac})=\frac{2n}{\log_2 n}\,(1+o(1))=(2\ln 2)\,\frac{n}{\ln n}\,(1+o(1)). \] The proof identifies the problem, on each ``slice'' of subsets of fixed cardinality, with the Erd\H{o}s--R\'enyi coin-weighing problem for a spring scale (the problem of \emph{detecting matrices}). The lower bound is the Erd\H{o}s--R\'enyi entropy argument applied to the middle slice; the upper bound follows from the explicit detecting families of Lindstr\"om and of Cantor and Mills, augmented by a single extra landmark that reveals cardinality.

cs.DM↗