The Probabilistic Min Dominating Set Problem
DOI10.1007/978-3-642-38536-0_26zbMath1381.68221OpenAlexW2158428793MaRDI QIDQ4928494
Vangelis Th. Paschos, Cécile Murat, Nicolas Boria
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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)
This page was built for publication: The Probabilistic Min Dominating Set Problem
