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

@article{Feldmann2018ThePH,
  title={The Parameterized Hardness of the k-Center Problem in Transportation Networks},
  author={A. Feldmann and D. Marx},
  journal={ArXiv},
  year={2018},
  volume={abs/1802.08563}
}
  • A. Feldmann, D. Marx
  • Published 2018
  • Computer Science, Mathematics
  • ArXiv
  • In this paper we study the hardness of the $k$-Center problem on inputs that model transportation networks. For the problem, an edge-weighted graph $G=(V,E)$ and an integer $k$ are given and a center set $C\subseteq V$ needs to be chosen such that $|C|\leq k$. The aim is to minimize the maximum distance of any vertex in the graph to the closest center. This problem arises in many applications of logistics, and thus it is natural to consider inputs that model transportation networks. Such inputs… CONTINUE READING
    Fixed-Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs
    6
    Hierarchy of Transportation Network Parameters and Hardness Results
    • J. Blum
    • Computer Science, Mathematics
    • 2019
    5
    Travelling on Graphs with Small Highway Dimension
    2
    The K-Centre Problem for Necklaces
    Grundy Coloring & friends, Half-Graphs, Bicliques
    3
    A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
    1

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 33 REFERENCES
    Fixed-Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs
    6
    Polynomial-Time Approximation Schemes for k-Center and Bounded-Capacity Vehicle Routing in Metrics with Bounded Highway Dimension
    8
    Approximating k-center in planar graphs
    16
    Hierarchy of Transportation Network Parameters and Hardness Results
    • J. Blum
    • Computer Science, Mathematics
    • 2019
    5
    Structural parameters, tight bounds, and approximation for (k, r)-center
    8
    On the computational complexity of centers locating in a graph
    40
    On the Parameterized Complexity of Approximating Dominating Set
    11
    Highway Dimension and Provably Efficient Shortest Path Algorithms
    48