Login / Signup

PTASs for secure dominating set in planar graphs and growth-bounded graphs.

Ke LiZhao Zhang
Published in: Discret. Appl. Math. (2024)
Keyphrases
  • planar graphs
  • dominating set
  • connected dominating set
  • max cut
  • facility location problem
  • approximate inference
  • minimum weight
  • approximation algorithms
  • undirected graph
  • np hard
  • graph cuts
  • weighted graph