The parameterized complexity of terminal monitoring set
From MaRDI portal
Publication:6575382
DOI10.1007/978-981-97-0566-5_7MaRDI QIDQ6575382
Publication date: 19 July 2024
Cites Work
- The \(k\)-hop connected dominating set problem: hardness and polyhedra
- The fault-tolerant capacitated \(K\)-center problem
- A kernelization algorithm for \(d\)-hitting set
- Clustering to minimize the maximum intercluster distance
- Algorithmic meta-theorems for restrictions of treewidth
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center
- Network hub location problems: The state of the art
- Parametrized complexity theory.
- Hardness of r-dominating set on Graphs of Diameter (r + 1)
- Nondeterminism within $P^ * $
- AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
- How to Allocate Network Centers
- The Capacitated K-Center Problem
- A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
- Parameterized Algorithms
- On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT
- A parameterized approximation algorithm for the multiple allocation \(k\)-hub center
This page was built for publication: The parameterized complexity of terminal monitoring set
