Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover

Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale. Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover. In Julián Mestre, Anthony Wirth, editors, 35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia. Volume 322 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. [doi]

Abstract

Abstract is missing.