The probabilistic and reliable connected power dominating set problems

DOI10.1007/s11590-018-1339-6zbMath1426.90190OpenAlexW2897191774MaRDI QIDQ2311207

Neng Fan, Ou Sun

Publication date: 10 July 2019

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10150/633265

zbMATH Keywords

integer programmingreliabilityconnectivityprobabilisticpower dominating set problemzero-injection buses

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10)

Related Items (1)

Probabilistic zero forcing on random graphs

Cites Work

• Unnamed Item
• An exact algorithm for minimum CDS with shortest path constraint in wireless networks
• The probabilistic minimum dominating set problem
• A distributed approximation algorithm for the bottleneck connected dominating set problem
• Solving the multistage PMU placement problem by integer programming and equivalent network design model
• Convex relaxations of chance constrained optimization problems
• Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
• Domination in Graphs Applied to Electric Power Networks

This page was built for publication: The probabilistic and reliable connected power dominating set problems