English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We study the  k  -Center  problem, where the input is a graph    $$G=(V,E)$$  G = ( V , E ) with positive edge weights and an integer  k , and the goal is to select  k  center vertices    $$C \subseteq V$$  C ⊆ V such that the maximum distance from any vertex to the closest center vertex is minimized. In general, this problem is    $$\mathsf {NP}$$  NP -hard and cannot be approximated within a factor less than 2. Typical applications of the  k  -Center  problem can be found in logistics or urban planning and hence, it is natural to study the problem on transportation networks. Common characterizations of such networks are graphs that are (almost) planar or have low doubling dimension, highway dimension or skeleton dimension. It was shown by Feldmann and Marx that  k  -Center  is    $$\mathsf {W[1]}$$  W [ 1 ] -hard on planar graphs of constant doubling dimension when parameterized by the number of centers  k , the highway dimension    $$hd$$  hd and the pathwidth    $$pw$$  pw (Feldmann and Marx 2020). We extend their result and show that even if we additionally parameterize by the skeleton dimension    $$\kappa $$  κ , the  k  -Center  problem remains    $$\mathsf {W[1]}$$  W [ 1 ] -hard. Moreover, we prove that under the Exponential Time Hypothesis there is no exact algorithm for  k  -Center  that has runtime    $$f(k,hd,pw,\kappa ) \cdot \vert V \vert ^{o(pw+ \kappa + \sqrt{k+hd})}$$  f ( k , h d , p w , κ ) · | V | o ( p w + κ + k + h d ) for any computable function  f .

W[1]-hardness of the k-center problem parameterized by the skeleton dimension