On the Parameterized Complexity of Min-Sum-Radii

Kumar, P., Müller, H., Ordyniak, S. orcid.org/0000-0003-1935-651X et al. (1 more author) (Accepted: 2026) On the Parameterized Complexity of Min-Sum-Radii. In: Leibniz International Proceedings in Informatics. SWAT 2026 - 20th Scandinavian Symposium on Algorithm Theory, 17-19 Jun 2026, Copenhagen, Denmark. . Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik, Wadern, Germany. ISSN: 1868-8969. EISSN: 1868-8969. (In Press)

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Dates:
  • Accepted: 10 April 2026
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Date Deposited: 13 May 2026 10:25
Last Modified: 13 May 2026 10:25
Status: In Press
Publisher: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
Open Archives Initiative ID (OAI ID):

Download not available

A full text copy of this item is not currently available from White Rose Research Online

Export

Statistics


CORE (COnnecting REpositories)