Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs

DOI10.1007/978-3-642-38016-7_8zbMath1395.68338OpenAlexW1603887547MaRDI QIDQ2848916

Vinícius G. Pereira de Sá, Celina M. Herrera de Figueiredo, Guilherme Dias da Fonseca, Raphael C. S. Machado

Publication date: 13 September 2013

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38016-7_8

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)

Related Items (2)

On the recognition of unit disk graphs and the distance geometry problem with ranges ⋮ The within-strip discrete unit disk cover problem

This page was built for publication: Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs