The expected size of the Rule k dominating set

DOI10.1007/S00453-006-0104-XMaRDI QIDQ866955zbMATH OpenOpenAlexFDO

Authors Jennie C. Hansen, Eric Schmutz, Li Sheng

Publication date 14 February 2007

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-006-0104-x

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• scientific article; zbMATH DE number 2019630
• Randomized greedy algorithms for finding smallk-dominating sets of regular graphs
• Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs
• Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes
• Minimum connected dominating sets in finite graphs

Cited in

(1)

• Covering random points in a unit disk

This page was built for publication: The expected size of the Rule \(k\) dominating set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q866955)