Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
cs.DS, cs.CC, cs.DM
Submitted: 2024-02-13
Updated: 2026-10-31
Project page: https://dragazo.github.io/bibdom/main.pdf
Terminology
Sources
- Parameterized algorithms for locating-dominating sets
- The $n/2$-bound for locating-dominating sets in subcubic graphs
- Non-Clashing Teaching Maps for Balls in Graphs
- Hitting Meets Packing: How Hard Can it Be?
- Core Stability in Additively Separable Hedonic Games of Low Treewidth
- Double Exponential Lower Bound for Telephone Broadcast
Related papers
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time
- Fast Odd-Permutation Sums in Characteristic Two and Shortest Even Directed Cycles