Greedy approximation for the minimum connected dominating set with labeling
type: Item
instance of: scholarly article
title: Greedy approximation for the minimum connected dominating set with labeling
zbMATH Open document ID: 1466.90092
author: Zishen Yang
author: Majun Shi
author: Wei Wang
published in: Optimization Letters
publication date: 2021-05-05T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7343974
zbMATH Keywords: greedy algorithm
zbMATH Keywords: connected dominating set
zbMATH Keywords: approximation algorithm
zbMATH Keywords: performance ratio
zbMATH Keywords: labeling
MaRDI profile type: Publication
full work available at URL: s11590-020-01628-6
OpenAlex ID: W3048387367
cites work: Connected dominating set. Theory and applications
cites work: Q3895508
cites work: Q4198056
cites work: Approximation algorithms for connected dominating sets
cites work: A greedy approximation for minimum connected dominating sets
cites work: Q3579442
cites work: The minimum labeling spanning trees
cites work: Spanning trees with many or few colors in edge-colored graphs
cites work: On the minimum label spanning tree problem
cites work: A note on the minimum label spanning tree.
cites work: Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem
cites work: A threshold of ln n for approximating set cover
cites work: Design and analysis of approximation algorithms
cites work: On colouring random graphs
DOI: 10.1007/S11590-020-01628-6
description: scientific article; zbMATH DE number 7343974