The parameterized hardness of the k-center problem in transportation networks

Feldmann, A.E. orcid.org/0000-0001-6229-5332 and Marx, D. (2018) The parameterized hardness of the k-center problem in transportation networks. In: Eppstein, D., (ed.) Leibniz International Proceedings in Informatics, LIPIcs. 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), 18-20 Jun 2018, Malmö, Sweden. Schloss Dagstuhl--Leibniz-Zentrum für Informatik , 19:1-19:13. ISBN 9783959770682

Abstract

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Editors:
  • Eppstein, D.
Copyright, Publisher and Additional Information:

© 2018 Andreas E. Feldmann and Daniel Marx. licensed under Creative Commons License CC-BY. (http://creativecommons.org/licenses/by/3.0/)

Keywords: k-center; parameterized complexity; planar graphs; doubling dimension; highway dimension; treewidth
Dates:
  • Published: 4 June 2018
  • Published (online): 4 June 2018
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 28 Jun 2023 11:54
Last Modified: 28 Jun 2023 11:54
Status: Published
Publisher: Schloss Dagstuhl--Leibniz-Zentrum für Informatik
Refereed: Yes
Identification Number: 10.4230/LIPIcs.SWAT.2018.19
Related URLs:
Open Archives Initiative ID (OAI ID):

Export

Statistics