A fast approximation algorithm for the maximum 2-packing set problem on planar graphs
From MaRDI portal
Publication:6110632
DOI10.1007/s11590-022-01939-wzbMath1527.90243MaRDI QIDQ6110632
Joel Antonio Trejo-Sánchez, Unnamed Author, Alejandro Flores-Lamas, José Alberto Fernández-Zepeda, Unnamed Author
Publication date: 6 July 2023
Published in: Optimization Letters (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Unnamed Item
- 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
- Exact exponential algorithms.
- Distance-\(k\) knowledge in self-stabilizing algorithms
- Roman domination in graphs.
- Algorithm to find a maximum 2-packing set in a cactus
- Independent sets with domination constraints
- A genetic algorithm for the maximum 2-packing set problem
- Finding near-optimal independent sets at scale
- Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs
- NP-hard graph problems and boundary classes of graphs
- The Design of Approximation Algorithms
- Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
- A Best Possible Heuristic for the k-Center Problem
- Efficient Planarity Testing
- Approximation algorithms for NP-complete problems on planar graphs
- A Self-Stabilizing Algorithm for a Maximal 2-Packing in a Cactus Graph Under Any Scheduler
- Approximating Maximum Clique by Removing Subgraphs
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
- Approximating independent sets in sparse graphs
- Approximating the minimum hub cover problem on planar graphs
This page was built for publication: A fast approximation algorithm for the maximum 2-packing set problem on planar graphs
