Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis

DOI10.1007/978-3-319-55911-7_5zbMath1485.68242OpenAlexW2599372767MaRDI QIDQ2988810

No author found.

Publication date: 19 May 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-55911-7_5

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)

Related Items (4)

Unnamed Item ⋮ Parameterized dynamic cluster editing ⋮ Dynamic parameterized problems ⋮ Parameterized Dynamic Cluster Editing

Uses Software

• DIMACS
• KONECT

Cites Work

• Unnamed Item
• Unnamed Item
• Exact algorithms for cluster editing: Evaluation and experiments
• Set multi-covering via inclusion-exclusion
• Analysis of a greedy heuristic for finding small dominating sets in graphs
• Experimental analysis of Heuristic algorithms for the dominating set problem
• Greedy randomized adaptive search procedures
• On complexity of lobbying in multiple referenda
• Polynomial-time data reduction for dominating set
• A Hybrid Graph Representation for Recursive Backtracking Algorithms
• A Greedy Heuristic for the Set-Covering Problem
• How to Allocate Network Centers
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• A trade-off between space and efficiency for routing tables
• Analytical approach to parallel repetition
• Automata, Languages and Programming

This page was built for publication: Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis