A novel evolutionary formulation of the maximum independent set problem
V. C. Barbosa, L. C. D. Campos
Abstract
We introduce a novel evolutionary formulation of the problem of finding a maximum independent set of a graph. The new formulation is based on the relationship that exists between a graph's independence number and its acyclic orientations. It views such orientations as individuals and evolves them with the aid of evolutionary operators that are very heavily based on the structure of the graph and its acyclic orientations. The resulting heuristic has been tested on some of the Second DIMACS Implementation Challenge benchmark graphs, and has been found to be competitive when compared to several of the other heuristics that have also been tested on those graphs.
Create a lesson
Related papers
DyssomniaNN: Multi-Scale Spiking Neural Modeling of Human Sleep Disorders and Perceived Restedness
Daniel Szelogowski
REMBGO for Evaluation-Limited Optimization: CEC2022 Benchmarking and EAF-STATCOM Generalization
Vikram Chekuri, Narapareddy Ramarao, Prashanth N A
Learning to Orchestrate Evolutionary Search: Progression-Aware Deep Reinforcement Learning for Dynamic DE-CMA-ES Coordination in Optimization and Structural Model Updating
Lechen Li, Rongye Shi, Wanhuan Zhou
Evolutionary Architecture Search for Chlorophyll-a Prediction in Lakes using Sentinel-2
Kursat Komurcu, Linas Petkevicius
The Modular CMA-ES: A Framework for Modern Evolution Strategies
Jacob de Nobel, Diederick Vermetten, Anna V. Kononova et al.
Relocating Nonlinearity: How a Downstream Learner Reshapes What Genetic Programming Must Evolve
Nam H. Le