On connected domination in unit ball graphs
type: Item
instance of: scholarly article
title: On connected domination in unit ball graphs
zbMATH Open document ID: 1220.90148
author: Sera Kahruman-Anderoglu
author: Oleksii Ursulenko
author: Sergiy Butenko
published in: Optimization Letters
publication date: 2011-05-20T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 5898455
zbMATH Keywords: connected dominating set
zbMATH Keywords: unit ball graph
zbMATH Keywords: wireless networks
MaRDI profile type: Publication
full work available at URL: s11590-010-0211-0
OpenAlex ID: W1987607815
cites work: Unit disk graph recognition is NP-hard
cites work: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
cites work: Unit disk graphs
cites work: Q4219187
cites work: Approximation algorithms for connected dominating sets
cites work: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
cites work: Improved bottleneck domination algorithms
DOI: 10.1007/S11590-010-0211-0
description: scientific article; zbMATH DE number 5898455