An exact algorithm for minimum CDS with shortest path constraint in wireless networks
type: Item
instance of: scholarly article
title: An exact algorithm for minimum CDS with shortest path constraint in wireless networks
zbMATH Open document ID: 1220.90149
author: Ling Ding
author: Xiaofeng Gao
author: Weili Wu
author: Xu Zhu
author: Wonjun Lee
published in: Optimization Letters
publication date: 2011-05-20T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5898462
zbMATH Keywords: CDS
zbMATH Keywords: shortest path
zbMATH Keywords: exact algorithm
MaRDI profile type: Publication
full work available at URL: s11590-010-0208-8
OpenAlex ID: W2144308400
cites work: Minimum connected dominating sets and maximal independent sets in unit disk graphs
cites work: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
cites work: Q4198056
cites work: Unit disk graphs
cites work: Approximation algorithms for connected dominating sets
cites work: A greedy approximation for minimum connected dominating sets
cites work: Improving construction for connected dominating set with Steiner tree in wireless sensor networks
cites work: Approximations for Steiner trees with minimum number of Steiner points
DOI: 10.1007/S11590-010-0208-8
description: scientific article; zbMATH DE number 5898462