Dynamic dominating set and turbo-charging greedy heuristics
From MaRDI portal
Publication:5074183
zbMATH Open1485.68244MaRDI QIDQ5074183FDOQ5074183
Authors:
Publication date: 9 May 2022
Recommendations
- Turbo-charging dominating set with an FPT subroutine: further improvements and experimental analysis
- On the parameterized complexity of dynamic problems
- Parameterized dynamic variants of red-blue dominating set
- On the parameterized complexity of dynamic problems with connectivity constraints
- Analysis of a greedy heuristic for finding small dominating sets in graphs
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Parameterized complexity, tractability and kernelization (68Q27)
Cited In (10)
- Turbocharging treewidth heuristics
- Parameterized Dynamic Cluster Editing
- Dynamic parameterized problems
- Parameterized dynamic variants of red-blue dominating set
- On the parameterized complexity of dynamic problems
- Parameterized dynamic cluster editing
- DASH: dynamic approach for switching heuristics
- Vertex Domination in Dynamic Networks
- Turbo-charging dominating set with an FPT subroutine: further improvements and experimental analysis
- Profit parameterizations of \textsc{Dominating Set}
This page was built for publication: Dynamic dominating set and turbo-charging greedy heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5074183)
