A genetic algorithm for the maximum 2-packing set problem
From MaRDI portal
Publication:2019714
DOI10.34768/amcs-2020-0014zbMath1464.05336OpenAlexW3042576929MaRDI QIDQ2019714
J. Octavio Gutierrez-Garcia, Daniel Fajardo-Delgado, Joel Antonio Trejo-Sánchez
Publication date: 22 April 2021
Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)
Full work available at URL: https://content.sciendo.com/view/journals/amcs/30/1/article-p173.xml
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient transformation of distance-2 self-stabilizing algorithms
- A self-stabilizing algorithm to maximal 2-packing with improved complexity
- Fast local search for the maximum independent set problem
- A Markov chain approach to randomly grown graphs
- The packing number of the double vertex graph of the path graph
- Algorithm to find a maximum 2-packing set in a cactus
- A hybrid iterated local search heuristic for the maximum weight independent set problem
- Closest paths in graph drawings under an elastic metric
- A robust algorithm to solve the signal setting problem considering different traffic assignment approaches
- Finding near-optimal independent sets at scale
- Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs
- A Best Possible Heuristic for the k-Center Problem
- A Self-Stabilizing Algorithm for a Maximal 2-Packing in a Cactus Graph Under Any Scheduler
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
- Reducibility among Combinatorial Problems
- Introduction to evolutionary computing
This page was built for publication: A genetic algorithm for the maximum 2-packing set problem
