Title of article
Semidefinite Relaxation for the Dominating Set Problem
Author/Authors
Ghaffari-Hadigheh, A Department of Applied Mathematics - Azarbaijan Shahid Madani University, Tabriz, Iran , Djahangiri, M Department of Applied Mathematics - Azarbaijan Shahid Madani University, Tabriz, Iran
Pages
12
From page
53
To page
64
Abstract
It is a well-known fact that finding a minimum dominating set and consequently finding the
domination number of a general graph is an NP-complete problem. Here, we first model this
problem as nonlinear binary optimization problems and then extract two closely related
semidefinite relaxations. For each of these relaxations, different rounding algorithms are exploited
to produce near-optimal dominating sets. Feasibility of the generated solutions and efficiency of
the algorithms are analyzed.
Keywords
Rounding algorithm , Semidefinite programming , Dominating set
Journal title
Astroparticle Physics
Serial Year
2015
Record number
2451705
Link To Document