The parameterized complexity of terminal monitoring set

DOI10.1007/978-981-97-0566-5_7MaRDI QIDQ6575382zbMATH OpenFDO

Authors N. R. Aravind, Roopam Saxena

Publication date 19 July 2024

Full work available at URL https://doi.org/10.1007/978-981-97-0566-5_7

zbMATH Keywords

fixed parameter tractabilityhitting sethub locationmonitoring setparameterized complexity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A kernelization algorithm for \(d\)-hitting set
• A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
• A parameterized approximation algorithm for the multiple allocation \(k\)-hub center
• Algorithmic meta-theorems for restrictions of treewidth
• AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
• Clustering to minimize the maximum intercluster distance
• Hardness of r-dominating set on graphs of diameter (r + 1)
• How to Allocate Network Centers
• Network hub location problems: The state of the art
• Nondeterminism within $P^ * $
• On structural parameterizations of Hitting Set: hitting paths in graphs using 2-SAT
• Parameterized algorithms
• Parametrized complexity theory.
• Structural parameters, tight bounds, and approximation for \((k, r)\)-center
• The k-hop connected dominating set problem: hardness and polyhedra
• The Capacitated K-Center Problem
• The fault-tolerant capacitated \(K\)-center problem

This page was built for publication: The parameterized complexity of terminal monitoring set

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