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

Neng Fan, Jean Paul Watson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

32 Scopus citations

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 languageEnglish (US)
Title of host publicationCombinatorial Optimization and Applications - 6th International Conference, COCOA 2012, Proceedings
Pages371-383
Number of pages13
DOIs
StatePublished - Aug 20 2012
Externally publishedYes
Event6th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2012 - Banff, AB, Canada
Duration: Aug 5 2012Aug 9 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7402 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other6th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2012
CountryCanada
CityBanff, AB
Period8/5/128/9/12

Keywords

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Solving the connected dominating set problem and power dominating set problem by integer programming'. Together they form a unique fingerprint.

Cite this