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

22 Citations (Scopus)

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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages371-383
Number of pages13
Volume7402 LNCS
DOIs
StatePublished - 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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Connected Dominating Set
Power set
Integer programming
Dominating Set
Integer Programming
Polynomials
Power System
Sensors
Sensor Placement
Integer Program
Polynomial
Formulation
Graph in graph theory

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

Fan, N., & Watson, J. P. (2012). Solving the connected dominating set problem and power dominating set problem by integer programming. In 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.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7402 LNCS 2012. p. 371-383 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7402 LNCS).

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

Fan, N & Watson, JP 2012, Solving the connected dominating set problem and power dominating set problem by integer programming. in 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
Fan N, Watson JP. Solving the connected dominating set problem and power dominating set problem by integer programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7402 LNCS. 2012. p. 371-383. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-31770-5_33
Fan, Neng ; Watson, Jean Paul. / Solving the connected dominating set problem and power dominating set problem by integer programming. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7402 LNCS 2012. pp. 371-383 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{403d8d47fa54434f88918ebeba3442a8,
title = "Solving the connected dominating set problem and power dominating set problem by integer programming",
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.",
keywords = "Connected Dominating Set Problem, Connected Subgraph, Integer Programming, Power Dominating Set Problem, Spanning Tree",
author = "Neng Fan and Watson, {Jean Paul}",
year = "2012",
doi = "10.1007/978-3-642-31770-5_33",
language = "English (US)",
isbn = "9783642317699",
volume = "7402 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "371--383",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

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 -