Structural parameterization of locating-dominating set and test cover

DOI10.1007/978-3-031-92932-8_13MaRDI QIDQ6902195zbMATH OpenFDO

Authors Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale

Publication date 11 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-92932-8_13

zbMATH Keywords

locating-dominating setparameterized complexitystructural parameterizationtest cover

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• (Non-)existence of polynomial kernels for the test cover problem
• A faster algorithm for vertex cover parameterized by solution size
• Approximation algorithms for the test cover problem
• Domination and location in acyclic graphs
• Exact exponential algorithms.
• scientific article; zbMATH DE number 3161569 (Why is no real title available?)
• scientific article; zbMATH DE number 4053685 (Why is no real title available?)
• scientific article; zbMATH DE number 4070954 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Induced subsets
• Linear-time algorithms for three domination-based separation problems in block graphs
• On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs
• Parameterizations of test cover with bounded test sizes
• Parameterized algorithms for locating-dominating sets
• Parameterized complexity of geodetic set
• Parameterized study of the test cover problem
• Partially polynomial kernels for set cover and test cover
• Paths to trees and cacti
• Tight approximability results for test set problems in bioinformatics

Cited in

(1)

• Parameterized algorithms for locating-dominating sets

This page was built for publication: Structural parameterization of locating-dominating set and test cover

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