An approximation algorithm for the total covering problem

DOI10.7151/dmgt.1380zbMath1142.05060arXiv1008.3216OpenAlexW2963745986MaRDI QIDQ3504806

Pooya Hatami

Publication date: 18 June 2008

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1008.3216

zbMATH Keywords

coveringapproximation algorithmtotal covering

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (6)

Mixed domination and 2-independence in trees ⋮ Mixed Roman domination in graphs ⋮ On the complexity of variations of mixed domination on graphs^† ⋮ Unnamed Item ⋮ Upper and lower bounds on approximating weighted mixed domination ⋮ Improved parameterized algorithms and kernels for mixed domination

This page was built for publication: An approximation algorithm for the total covering problem