Exact and heuristic algorithms for the domination problem

DOI10.1016/J.EJOR.2023.08.033MaRDI QIDQ6555173

F. A. Hernández-Mira, Jose M. Sigarreta, Nodari Vakhania, Ernesto Parra Inza

Publication date: 14 June 2024

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

graph theoryheuristicdominating settime complexityenumeration algorithmcombination optimization

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Exact algorithms for dominating set
• Analysis of a greedy heuristic for finding small dominating sets in graphs
• The \(k\)-neighbor, \(r\)-domination problems on interval graphs
• The weighted independent domination problem: integer linear programming models and metaheuristic approaches
• Exact and heuristic algorithms for the weighted total domination problem
• A polynomial-time approximation to a minimum dominating set in a graph
• Heuristics for \(k\)-domination models of facility location problems in street networks
• A Faster Algorithm for Dominating Set Analyzed by the Potential Method
• Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
• A Greedy Heuristic for the Set-Covering Problem
• Domination in Graphs Applied to Electric Power Networks
• From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More
• Computing and Combinatorics

This page was built for publication: Exact and heuristic algorithms for the domination problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6555173)