A better constant-factor approximation for weighted dominating set in unit disk graph
type: Item
instance of: scholarly article
title: A better constant-factor approximation for weighted dominating set in unit disk graph
zbMATH Open document ID: 1184.05090
author: Yaochun Huang
author: Xiaofeng Gao
author: Zhao Zhang
author: Weili Wu
published in: Journal of Combinatorial Optimization
publication date: 2009-11-16T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C22
zbMATH DE Number: 5633378
zbMATH Keywords: wireless network
zbMATH Keywords: connected dominating set
zbMATH Keywords: unit disk graph
MaRDI profile type: Publication
full work available at URL: s10878-008-9146-0
OpenAlex ID: W2063726026
cites work: Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
cites work: Approximation algorithms for NP-complete problems on planar graphs
cites work: On approximation problems related to the independent set and vertex cover problems
cites work: Unit disk graphs
cites work: Q4228484
cites work: Q4198056
cites work: Approximation schemes for covering and packing problems in image processing and VLSI
cites work: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
cites work: Planar Formulae and Their Uses
cites work: Simple heuristics for unit disk graphs
cites work: Chebyshev's approximation algorithms and applications
DOI: 10.1007/S10878-008-9146-0
description: scientific article; zbMATH DE number 5633378