An Adaptive Repeated-Intersection-Reduction Local Search for the Maximum Independent Set Problem

08/16/2022
by   Enqiang Zhu, et al.
0

The maximum independent set (MIS) problem, a classical NP-hard problem with extensive applications in various areas, aims to find a largest set of vertices with no edge among them. Due to its computational intractability, it is difficult to solve the MIS problem effectively, especially on large graphs. Employing heuristic approaches to obtain a good solution within an acceptable amount of time has attracted much attention in literature. In this paper, we propose an efficient local search algorithm for MIS called ARIR, which consists of two main parts: an adaptive local search framework, and a novel inexact efficient reduction rule to simplify instances. We conduct experiments on five benchmarks, encompassing 92 instances. Compared with four state-of-the-art algorithms, ARIR offers the best accuracy on 89 instances and obtains competitive results on the three remaining instances.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/25/2023

A Dual-mode Local Search Algorithm for Solving the Minimum Dominating Set Problem

Given a graph, the minimum dominating set (MinDS) problem is to identify...
research
10/25/2018

Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs

One powerful technique to solve NP-hard optimization problems in practic...
research
03/28/2022

A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems

Motivated by a real-world vehicle routing application, we consider the m...
research
05/20/2017

Combining tabu search and graph reduction to solve the maximum balanced biclique problem

The Maximum Balanced Biclique Problem is a well-known graph model with r...
research
07/02/2022

Efficient and Effective Local Search for the Set-Union Knapsack Problem and Budgeted Maximum Coverage Problem

The Set-Union Knapsack Problem (SUKP) and Budgeted Maximum Coverage Prob...
research
01/24/2022

An Effective Iterated Two-stage Heuristic Algorithm for the Multiple Traveling Salesmen Problem

The multiple Traveling Salesmen Problem mTSP is a general extension of t...
research
02/04/2014

NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover

The Minimum Vertex Cover (MVC) problem is a prominent NP-hard combinator...

Please sign up or login with your details

Forgot password? Click here to reset