Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2003.06639

Graph Profiling for Vertex Cover: Targeted Reductions in a Branch and Reduce Solver

Matthias F. Stallmann·Yang Ho·Timothy D. Goodrich
View original source ↗Read source document ↗Export metadata ↓

Abstract

Akiba and Iwata [TCS, 2016] demonstrated that a branch and reduce (B&R) solver for the vertex cover problem can compete favorably with integer linear programming solvers (e.g., CPLEX). Our research question is are there graph characteristics that determine which reductions will be most effective? Not only is the answer affirmative, but relevant characteristics are easy to identify. To explore our ideas, we provide an enhanced version of the Akiba-Iwata solver that can (a) be configured with any subset of reductions and lower bounds; (b) print statistics such as time taken and number of vertices reduced by each reduction. Based on extensive experiments with benchmark and random instances we demonstrate that (i) more reductions do not necessarily lead to better runtimes; (ii) the subset of reductions leading to the best (or nearly the best) runtime can be predicted based on measurable characteristics of a graph, e.g., density and degree distribution; and (iii) exceptions have structural characteristics known in advance. Our primary contributions are 1. A thorough examination reduction routine performance in the context of graph characteristics. 2. Three primary hypotheses suggesting simple suites of reductions as the most efficient options. 3. Experiments with a large corpus of data to validate our hypotheses. 4. Measures that quantify a problem instance on two key dimensions to make our hypotheses concrete. 5. An enhanced open-source version of the Akiba-Iwata solver that enables our investigations and creates opportunities for future exploration. Our main objective is to provide guidance to a user so that, faced with a given problem instance or set of instances, they may most effectively use the available reductions. Ultimately these efforts can lead to an automated process.

Explore related subjects

cs.DS

Keep this discovery

BibTeXRIS

Matthias F. Stallmann, Yang Ho, Timothy D. Goodrich. 2020-03-14. Graph Profiling for Vertex Cover: Targeted Reductions in a Branch and Reduce Solver. https://arxiv.org/abs/2003.06639

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↗