Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2008.01961

An Algorithm Framework for the Exact Solution and Improved Approximation of the Maximum Weighted Independent Set Problem

Kai Sun
View original source ↗Read source document ↗Export metadata ↓

Abstract

The Maximum Weighted Independent Set (MWIS) problem, which considers a graph with weights assigned to nodes and seeks to discover the "heaviest" independent set, that is, a set of nodes with maximum total weight so that no two nodes in the set are connected by an edge. The MWIS problem arises in many application domains, including the resource-constrained scheduling, error-correcting coding, complex system analysis and optimization, and communication networks. Since solving the MWIS problem is the core function for finding the optimum solution of our novel graph-based formulation of the resource-constrained Process Planning and Scheduling (PPS) problem, it is essential to have "good-performance" algorithms to solve the MWIS problem. In this paper, we propose a Novel Hybrid Heuristic Algorithm (NHHA) framework in a divide-and-conquer structure that yields optimum feasible solutions to the MWIS problem. The NHHA framework is optimized to minimize the recurrence. Using the NHHA framework, we also solve the All Maximal Independent Sets Listing (AMISL) problem, which can be seen as the subproblem of the MWIS problem. Moreover, building composed MWIS algorithms that utilizing fast approximation algorithms with the NHHA framework is an effective way to improve the accuracy of approximation MWIS algorithms (e.g., GWMIN and GWMIN2 (Sakai et al., 2003)). Eight algorithms for the MWIS problem, the exact MWIS algorithm, the AMISL algorithm, two approximation algorithms from the literature, and four composed algorithms, are applied and tested for solving the graph-based formulation of the resource-constrained PPS problem to evaluate the scalability, accuracy, and robustness.

Explore related subjects

cs.DSmath.COmath.OC

Keep this discovery

BibTeXRIS

Kai Sun. 2020-08-05. An Algorithm Framework for the Exact Solution and Improved Approximation of the Maximum Weighted Independent Set Problem. https://arxiv.org/abs/2008.01961

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↗