Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic

DOI10.1051/ro/2013034zbMath1282.05180OpenAlexW2100009654MaRDI QIDQ5397695

Raksmey Phan, Christian Laforest

Publication date: 24 February 2014

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/384f69e29a291accdf3b52bae25b15973b955e54

zbMATH Keywords

heuristicscombinatorial optimizationexact algorithmworst case analysisexperimentationsindependent dominating set in graphs

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

An analysis of root functions -- a subclass of the impossible class of faulty functions (ICFF) ⋮ On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm ⋮ An Efficient Local Search for the Minimum Independent Dominating Set Problem

This page was built for publication: Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic