The probabilistic and reliable connected power dominating set problems

DOI10.1007/S11590-018-1339-6zbMATH Open1426.90190OpenAlexW2897191774WikidataQ129088723 ScholiaQ129088723MaRDI QIDQ2311207FDOQ2311207

Authors: Ou Sun, Neng Fan 

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

Recommendations

• Solving the connected dominating set problem and power dominating set problem by integer programming
• Connected power domination in graphs
• Restricted power domination and fault-tolerant power domination on grids
• Domination in Graphs Applied to Electric Power Networks
• The PMU Placement Problem

zbMATH Keywords

probabilisticreliabilityinteger programmingconnectivitypower dominating set problemzero-injection buses

Mathematics Subject Classification ID

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

Cites Work

• Network flows. Theory, algorithms, and applications.
• Convex relaxations of chance constrained optimization problems
• Domination in Graphs Applied to Electric Power Networks
• Solving the multistage PMU placement problem by integer programming and equivalent network design model
• An exact algorithm for minimum CDS with shortest path constraint in wireless networks
• Solving the connected dominating set problem and power dominating set problem by integer programming
• A distributed approximation algorithm for the bottleneck connected dominating set problem
• The probabilistic minimum dominating set problem

Cited In (2)

• Probabilistic zero forcing on random graphs
• Solving the connected dominating set problem and power dominating set problem by integer programming

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

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