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

Feldmann, AE and Marx, Dániel (2018) The parameterized hardness of the k-center problem in transportation networks. In: 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018. Leibniz International Proceedings in Informatics, LIPIcs (101). Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 191-1913. ISBN 9783959770682 10.4230/LIPIcs.SWAT.2018.19

[img]
Preview
Text
Feldmann_13_3424410_ny.pdf

Download (548kB) | Preview
Item Type: Book Section
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Informatics Laboratory
SWORD Depositor: MTMT Injector
Depositing User: MTMT Injector
Date Deposited: 26 Sep 2018 06:34
Last Modified: 21 Jul 2019 13:39
URI: http://eprints.sztaki.hu/id/eprint/9441

Update Item Update Item