Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function

02/15/2017
by   Yiyuan Wang, et al.
0

The Minimum Weight Dominating Set (MWDS) problem is an important generalization of the Minimum Dominating Set (MDS) problem with extensive applications. This paper proposes a new local search algorithm for the MWDS problem, which is based on two new ideas. The first idea is a heuristic called two-level configuration checking (CC2), which is a new variant of a recent powerful configuration checking strategy (CC) for effectively avoiding the recent search paths. The second idea is a novel scoring function based on the frequency of being uncovered of vertices. Our algorithm is called CC2FS, according to the names of the two ideas. The experimental results show that, CC2FS performs much better than some state-of-the-art algorithms in terms of solution quality on a broad range of MWDS benchmarks.

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
02/19/2018

An Efficient Local Search for the Minimum Independent Dominating Set Problem

In the present paper, we propose an efficient local search for the minim...
research
06/06/2019

Combining Reinforcement Learning and Configuration Checking for Maximum k-plex Problem

The Maximum k-plex Problem is an important combinatorial optimization pr...
research
03/14/2021

On distributed algorithms for minimum dominating set problem and beyond

In this paper, we study the minimum dominating set (MDS) problem and the...
research
06/28/2022

Hybrid cuckoo search algorithm for the minimum dominating set problem

The notions of dominating sets of graphs began almost 400 years ago with...
research
06/28/2021

Greedy and Local Search Heuristics to Build Area-Optimal Polygons

In this paper, we present our heuristic solutions to the problems of fin...
research
08/21/2020

Optimal Metric Search Is Equivalent to the Minimum Dominating Set Problem

In metric search, worst-case analysis is of little value, as the search ...

Please sign up or login with your details

Forgot password? Click here to reset