Exact and heuristic algorithms for the domination problem
From MaRDI portal
Cites work
- A faster algorithm for dominating set analyzed by the potential method
- A Greedy Heuristic for the Set-Covering Problem
- A polynomial-time approximation to a minimum dominating set in a graph
- Analysis of a greedy heuristic for finding small dominating sets in graphs
- Computing and Combinatorics
- Domination in Graphs Applied to Electric Power Networks
- Exact algorithms for dominating set
- Exact and heuristic algorithms for the weighted total domination problem
- From gap-exponential time hypothesis to fixed parameter tractable inapproximability: clique, dominating set, and more
- Graph domination, coloring and cliques in telecommunications
- Heuristics for \(k\)-domination models of facility location problems in street networks
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 6469213 (Why is no real title available?)
- Solving the connected dominating set problem and power dominating set problem by integer programming
- The k-neighbor, r-domination problems on interval graphs
- The weighted independent domination problem: integer linear programming models and metaheuristic approaches
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)
