SIAM Journal on Discrete Mathematics· 2026Q1
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover
- 1citations
- Q1SCImago
- 2026year
Short summary
Locating-Dominating Set and Test Cover problems do not admit algorithms faster than O(2^tw) or O(2^k) respectively, and polynomial-time kernelization with O(tw) or O(k) vertices, unless the Exponential Time Hypothesis (ETH) fails.
AI-generated from the title and abstract; the full text is not read.
TakeawaysIn the app
Key pointsIn the app
Ask the paperIn the app
The rest is in the Pofolia app
Takeaways, key points and questions to the paper; new summaries every day for your field. Free.
Sign in on the web to openField: Computational Theory and Mathematics
Computational Theory and MathematicsComputer Science