How to guard a graph against tree moves

DOI10.1016/j.ipl.2013.07.025zbMath1284.68666MaRDI QIDQ2445266

Toshihiro Fujito, Takayoshi Sakamaki

Publication date: 14 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.07.025

zbMATH Keywords

approximation algorithms; set cover; greedy approximation; guarding game

Mathematics Subject Classification ID

91A43: Games involving graphs

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

68W25: Approximation algorithms

05C57: Games on graphs (graph-theoretic aspects)