On the complexity of the minimum outer-connected dominating set problem in graphs

2014 ◽  
Vol 31 (1) ◽  
pp. 1-12 ◽  
Author(s):  
D. Pradhan
Keyword(s):  
Dominating Set ◽  
Connected Dominating Set ◽  
Dominating Set Problem

scholarly journals A matheuristic approach for solving the 2-connected dominating set problem

2020 ◽  
pp. 52-52
Author(s):  
Raka Jovanovic ◽  
Stefan Voß
Keyword(s):  
Dominating Set ◽  
Integer Program ◽  
Connected Dominating Set ◽  
Mixed Integer ◽  
Mixed Integer Program ◽  
Adaptive Search ◽  
Optimal Solutions ◽  
Large Graphs ◽  
Dominating Set Problem ◽  
General Graphs

This paper describes a matheuristic approach for solving the 2-connected dominating set problem (2-CDS). The goal of the proposed method is to find near optimal solutions for large graphs. The algorithm is based on a Greedy Randomized Adaptive Search Procedure (GRASP). Its performance is enhanced by combining it with a second local search method that uses a Mixed Integer Program. The performance of the proposed method is evaluated on large unit disc graphs having varying edge densities and on general graphs.

Sign in / Sign up

Export Citation Format

Share Document