Improved Combinatorial Approximation Algorithms for MAX CUT in Sparse Graphs

Eiichiro Sato

Home/Archive/arXiv

arXiv · 2202.13727

Improved Combinatorial Approximation Algorithms for MAX CUT in Sparse Graphs

Eiichiro Sato

View original source ↗Read source document ↗Export metadata ↓

Abstract

The Max-Cut problem is a fundamental NP-hard problem, which is attracting attention in the field of quantum computation these days. Regarding the approximation algorithm of the Max-Cut problem, algorithms based on semidefinite programming have achieved much better approximation ratios than combinatorial algorithms. Therefore, filling the gap is an interesting topic as combinatorial algorithms also have some merits. In sparse graphs, there is a linear-time combinatorial algorithm with the approximation ratio $\frac{1}{2}+\frac{n-1}{4m}$ [Ngoc and Tuza, Comb. Probab. Comput. 1993], which is known as the Edwards-Erd\H{o}s bound. In subcubic graphs, the combinatorial algorithm by Bazgan and Tuza [Discrete Math. 2008] has the best approximation ratio $\frac{5}{6}$ that runs in $O(n^2)$ time. Based on the approach by Bazgan and Tuza, we introduce a new vertex decomposition of graphs, which we call tree-bipartite decomposition. With the decomposition, we present a linear-time $(\frac{1}{2}+\frac{n-1}{2m})$-approximation algorithm for the Max-Cut problem. As a derivative, we also present a linear-time $\frac{5}{6}$-approximation algorithm in subcubic graphs, which solves an open problem in their paper.

Explore related subjects

cs.DS cs.DM

Keep this discovery

BibTeX RIS

Eiichiro Sato. 2022-02-28. Improved Combinatorial Approximation Algorithms for MAX CUT in Sparse Graphs. https://arxiv.org/abs/2202.13727

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

A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix

For every fixed $0<\varepsilon\le1$, we give a deterministic strongly polynomial algorithm that, given a nonnegative matrix $A\in\mathbb{R}_{\ge0}^{n\times n}$, returns $Q$ satisfying $\operatorname{per} A\le Q\le(1+\varepsilon)^n\operatorname{per} A$.

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↗