Relaxed connected dominating set problem with application to secure power network design

Abstract

This paper investigates a combinatorial optimization problem motived from a secure power network design application in [Dán and Sandberg 2010]. Two equivalent graph optimization formulations are derived. One of the formulations is a relaxed version of the connected dominating set problem, motivating the term relaxed connected dominating set (RCDS… (More)
DOI: 10.23919/ACC.2017.7963674

2 Figures and Tables

Cite this paper

@article{Sou2017RelaxedCD, title={Relaxed connected dominating set problem with application to secure power network design}, author={Kin Cheong Sou and Jie Lu}, journal={2017 American Control Conference (ACC)}, year={2017}, pages={4657-4662} }