Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.33779

Solving Vertex Integrity Faster than $2^n$

Sandip Das·Sweta Das·Sk Samim Islam·Ritam Manna Mitra·Aashirwad Mohapatra·Arkaprava Paul
View original source ↗Read source document ↗Export metadata ↓

Abstract

The vertex integrity of a graph $G$ is the minimum of $|S|+\max_{C\in\operatorname{cc}(G-S)}|V(C)|$ over all vertex sets $S\subseteq V(G)$, where the maximum is zero if $G-S$ is empty. We study its exact exponential complexity in terms of $n=|V(G)|$. First, we give a reduction from Vertex Cover on subcubic graphs that increases the number of vertices by only a constant factor. Consequently, unless the Exponential Time Hypothesis fails, Vertex Integrity admits no $2^{o(n)}n^{O(1)}$-time algorithm. We also give a deterministic exact algorithm running in $O(1.9602^n)$ time and space, improving on the direct $O^*(2^n)$ algorithm. Its key ingredients are a balanced partition of the components left by an optimal irredundant separator and a subset dynamic program restricted to sets of at most $\lceil 2n/5\rceil$ vertices. An optimal separator can be recovered within the same bounds.

Explore related subjects

cs.DScs.DM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sandip Das, Sweta Das, Sk Samim Islam, Ritam Manna Mitra, Aashirwad Mohapatra, Arkaprava Paul. 2026-09-27. Solving Vertex Integrity Faster than $2^n$. https://arxiv.org/abs/2609.33779

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

KEEP EXPLORING

Related papers

arXiv2026

Gap-free Differentially Private PCA for Gaussian Data

We give a gap-free $(ε,δ)$-differentially private algorithm for the principal component analysis (PCA) problem with Gaussian data. The algorithm is based on a private variant of the power iteration method, and it is computationally efficient.

cs.DS↗
arXiv2026

On Extensions of the Unanimous Vote Problem

The Unanimous Vote problem is to determine a fixed order in which to flip each of $n$ biased coins, where each coin can be flipped only once, such that the expected number of flips until seeing both a head and a tail (or flipping all coins) is minimized. Duman Keles et al. (arXiv:2510.16678 [cs.DS]) gave an $\mathcal{O}(n \log n)$-time algorithm for this problem. Extensions of the Unanimous Vote problem are a rich source of stochastic optimization problems. We focus on three: (1) a variant in which each coin can be flipped arbitrarily many times (a solution is thus an infinite sequence of coin choices), (2) a generalization with $d$-sided dice, that can each be rolled once, where dice must be rolled until two different outcomes are observed (or all dice have been rolled), and (3) a different generalization with $d$-sided dice, where dice must be rolled until all $d$ outcomes have been observed. For (1), we show that there is an optimal sequence which follows a simple greedy rule; the same rule only gives a 1-additive approximation for the original problem (arXiv:2510.16678 [cs.DS]). The rule also yields a correspondence between a particular optimal sequence and a related mechanical word, which we exploit to characterize the conditions under which this optimal sequence is periodic. We establish tight multiplicative and additive adaptivity gaps for this variant. For (2), we show that two different generalizations of the greedy rule from (arXiv:2510.16678 [cs.DS]) can be combined to obtain a PTAS. For (3), we give an $\mathcal{O}(\log d)$-approximation algorithm by reducing the problem to Submodular Ranking (arXiv:1007.2503 [cs.DS]); the same reduction technique can be used to yield approximation algorithms for other stochastic probing problems. Finally, we pose a number of related open questions.

cs.DS↗
arXiv2026

Local Search for Fair Max-Min Diversification

Given $n$ points in a metric space, Max-Min diversification asks for a subset of $k$ points maximizing the minimum pairwise distance between the selected points. This is arguably the most fundamental notion of diversity with applications across a wide range of domains. We consider this problem under partition constraints, previously studied as Fair Max-Min Diversification (FMMD). Here, each point has a color in $[m]$, and a feasible solution must contain exactly $k_i$ points of color $i$, where $k_1,\ldots,k_m$ are prescribed parameters satisfying $\sum_i k_i=k$. We give the first constant factor approximation for the problem using local search, that runs in time $f(m)\cdot \operatorname{poly}(n)$, in which all constraints are satisfied exactly. All previously known algorithms either provided an $\widetilde Θ(m)$ approximation factor, had running times exponential in the solution size $k$, or satisfied the fairness constraints only approximately or in expectation. We further generalize our result to the problem where each point may belong to an arbitrary subset of colors. Given lower and upper bounds $\ell_i$ and $u_i$ for every color $i$, the goal is to find $k$ points whose color counts satisfy all these bounds while maximizing their diversity.

cs.DS↗