The probabilistic min dominating set problem

DOI10.1007/978-3-642-38536-0_26MaRDI QIDQ4928494zbMATH OpenOpenAlexFDO

Authors Nicolas Boria, C. Murat, Vangelis Th. Paschos

Publication date 14 June 2013

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38536-0_26

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• The probabilistic minimum dominating set problem
• Probabilistic algorithm for minimum \(k\)-fold dominating set problem
• Approximation algorithms for connected dominating sets
• MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS
• Approximation algorithms for connected dominating sets

Cited in

(5)

• The probabilistic minimum dominating set problem
• On the chance-constrained minimum spanning \(k\)-core problem
• Movable dominating sensor sets in networks
• The probabilistic minimum spanning tree problem
• The Probabilistic Minimum Vertex-covering Problem

This page was built for publication: The probabilistic min dominating set problem

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