### Abstract

In this paper, we propose several integer programming approaches with a polynomial number of constraints to formulate and solve the minimum connected dominating set problem. Further, we consider both the power dominating set problem - a special dominating set problem for sensor placement in power systems - and its connected version. We propose formulations and algorithms to solve these integer programs, and report results for several power system graphs.

Original language | English (US) |
---|---|

Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

Pages | 371-383 |

Number of pages | 13 |

Volume | 7402 LNCS |

DOIs | |

State | Published - 2012 |

Externally published | Yes |

Event | 6th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2012 - Banff, AB, Canada Duration: Aug 5 2012 → Aug 9 2012 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 7402 LNCS |

ISSN (Print) | 03029743 |

ISSN (Electronic) | 16113349 |

### Other

Other | 6th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2012 |
---|---|

Country | Canada |

City | Banff, AB |

Period | 8/5/12 → 8/9/12 |

### Fingerprint

### Keywords

- Connected Dominating Set Problem
- Connected Subgraph
- Integer Programming
- Power Dominating Set Problem
- Spanning Tree

### ASJC Scopus subject areas

- Computer Science(all)
- Theoretical Computer Science

### Cite this

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*(Vol. 7402 LNCS, pp. 371-383). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7402 LNCS). https://doi.org/10.1007/978-3-642-31770-5_33

**Solving the connected dominating set problem and power dominating set problem by integer programming.** / Fan, Neng; Watson, Jean Paul.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).*vol. 7402 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7402 LNCS, pp. 371-383, 6th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2012, Banff, AB, Canada, 8/5/12. https://doi.org/10.1007/978-3-642-31770-5_33

}

TY - GEN

T1 - Solving the connected dominating set problem and power dominating set problem by integer programming

AU - Fan, Neng

AU - Watson, Jean Paul

PY - 2012

Y1 - 2012

N2 - In this paper, we propose several integer programming approaches with a polynomial number of constraints to formulate and solve the minimum connected dominating set problem. Further, we consider both the power dominating set problem - a special dominating set problem for sensor placement in power systems - and its connected version. We propose formulations and algorithms to solve these integer programs, and report results for several power system graphs.

AB - In this paper, we propose several integer programming approaches with a polynomial number of constraints to formulate and solve the minimum connected dominating set problem. Further, we consider both the power dominating set problem - a special dominating set problem for sensor placement in power systems - and its connected version. We propose formulations and algorithms to solve these integer programs, and report results for several power system graphs.

KW - Connected Dominating Set Problem

KW - Connected Subgraph

KW - Integer Programming

KW - Power Dominating Set Problem

KW - Spanning Tree

UR - http://www.scopus.com/inward/record.url?scp=84865036095&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84865036095&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-31770-5_33

DO - 10.1007/978-3-642-31770-5_33

M3 - Conference contribution

AN - SCOPUS:84865036095

SN - 9783642317699

VL - 7402 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 371

EP - 383

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -