Dynamic dominating set and turbo-charging greedy heuristics

MaRDI QIDQ5074183zbMATH OpenFDO

Authors

Publication date 9 May 2022

Mathematics Subject Classification ID

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)

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

Cited in

(10)

• Turbocharging treewidth heuristics
• Parameterized Dynamic Cluster Editing
• Dynamic parameterized problems
• On the parameterized complexity of dynamic problems
• Parameterized dynamic variants of red-blue dominating set
• Parameterized dynamic cluster editing
• DASH: dynamic approach for switching heuristics
• Turbo-charging dominating set with an FPT subroutine: further improvements and experimental analysis
• Vertex Domination in Dynamic Networks
• 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)