PTASs for secure dominating set in planar graphs and growth-bounded graphs
From MaRDI portal
Publication:6611035
DOI10.1016/J.DAM.2024.06.026zbMATH Open1547.05227MaRDI QIDQ6611035
Publication date: 26 September 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation algorithms for maximum independent set of pseudo-disks
- An improved binary programming formulation for the secure domination problem
- On computing a minimum secure dominating set in block graphs
- The complexity of secure domination problem in graphs
- The secure domination problem in cographs
- A simple algorithm for secure domination in proper interval graphs
- Algorithmic aspects of secure connected domination in graphs
- The secure domination number of Cartesian products of small graphs with paths and cycles
- Secure domination of honeycomb networks
- On secure domination in graphs
- Secure domination in cographs
- A linear algorithm for secure domination in trees
- A note on secure domination in \(C_5\)-free graphs
- Secure connected domination and secure total domination in unit disk graphs and rectangle graphs
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- Approximation schemes for wireless networks
- On computing secure domination of trees
- Optimal Coverage in Wireless Sensor Networks
- PTAS for geometric hitting set problems via local search
This page was built for publication: PTASs for secure dominating set in planar graphs and growth-bounded graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6611035)
