The Parameterized Hardness of the k-Center Problem in Transportation Networks

Andreas Emil Feldmann, Dániel Marx. The Parameterized Hardness of the k-Center Problem in Transportation Networks. In David Eppstein, editor, 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018, June 18-20, 2018, Malmö, Sweden. Volume 101 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]

Abstract

Abstract is missing.