A genetic algorithm for the maximum 2-packing set problem
DOI10.34768/AMCS-2020-0014zbMATH Open1464.05336OpenAlexW3042576929MaRDI QIDQ2019714FDOQ2019714
Authors: Daniel Fajardo-Delgado, J. Octavio Gutierrez-Garcia, Joel Trejo-Sanchez 
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
Recommendations
- Algorithm to find a maximum 2-packing set in a cactus
- Genetic algorithmic approach to find the maximum weight independent set of a graph
- A genetic algorithm for the set covering problem
- Improved genetic algorithm for maximum clique problem
- A new heuristic algorithm to solve the maximum independent set problem
Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distributed algorithms (68W15)
Cites Work
- Title not available (Why is that?)
- Reducibility among combinatorial problems
- A Best Possible Heuristic for the k-Center Problem
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
- Finding near-optimal independent sets at scale
- Title not available (Why is that?)
- Fast local search for the maximum independent set problem
- Efficient transformation of distance-2 self-stabilizing algorithms
- A self-stabilizing algorithm to maximal 2-packing with improved complexity
- A Markov chain approach to randomly grown graphs
- An introduction to systems biology. Design principles of biological circuits
- Introduction to evolutionary computing
- The packing number of the double vertex graph of the path graph
- Algorithm to find a maximum 2-packing set in a cactus
- Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs
- A self-stabilizing algorithm for a maximal 2-packing in a cactus graph under any scheduler
- 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
Cited In (5)
- A genetic algorithm for determining the thickness of a graph
- A fast approximation algorithm for the maximum 2-packing set problem on planar graphs
- Title not available (Why is that?)
- On genetic algorithms for the packing of polygons
- Genetic Algorithms and Heuristic Rules for Solving the Nesting Problem in the Package Industry
Uses Software
This page was built for publication: A genetic algorithm for the maximum 2-packing set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019714)
