A PTAS for minimum \(d\)-hop connected dominating set in growth-bounded graphs
type: Item
instance of: scholarly article
title: A PTAS for minimum \(d\)-hop connected dominating set in growth-bounded graphs
zbMATH Open document ID: 1202.90042
author: Xiaofeng Gao
author: Wei Wang
author: Zhao Zhang
author: Shiwei Zhu
author: Weili Wu
published in: Optimization Letters
publication date: 2010-10-04T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5795204
MaRDI profile type: Publication
full work available at URL: s11590-009-0148-3
OpenAlex ID: W1970098960
cites work: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
cites work: A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
cites work: Approximation and Online Algorithms
cites work: Distributed routing algorithms for multi-hop ad hoc networks using \(d\)-hop connected \(d\)-dominating sets
DOI: 10.1007/S11590-009-0148-3
description: scientific article; zbMATH DE number 5795204