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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Let $G=(V,E)$ be a graph with unit-length edges and nonnegative costsassigned to its vertices. Being given a list of pairwise different vertices$S=(s_1,s_2,\ldots,s_p)$, the {\em prioritized Voronoi diagram} of $G$ withrespect to $S$ is the partition of $G$ in $p$ subsets $V_1,V_2,\ldots,V_p$ sothat, for every $i$ with $1 \leq i \leq p$, a vertex $v$ is in $V_i$ if andonly if $s_i$ is a closest vertex to $v$ in $S$ and there is no closest vertexto $v$ in $S$ within the subset $\{s_1,s_2,\ldots,s_{i-1}\}$. For every $i$with $1 \leq i \leq p$, the {\em load} of vertex $s_i$ equals the sum of thecosts of all vertices in $V_i$. The load of $S$ equals the maximum load of avertex in $S$. We study the problem of adding one more vertex $v$ at the end of$S$ in order to minimize the load. This problem occurs in the context ofoptimally locating a new service facility ({\it e.g.}, a school or a hospital)while taking into account already existing facilities, and with the goal ofminimizing the maximum congestion at a site. There is a brute-force algorithmfor solving this problem in ${\cal O}(nm)$ time on $n$-vertex $m$-edge graphs.We prove a matching time lower bound for the special case where $m=n^{1+o(1)}$and $p=1$, assuming the so called Hitting Set Conjecture of Abboud et al. Onthe positive side, we present simple linear-time algorithms for this problem oncliques, paths and cycles, and almost linear-time algorithms for trees, properinterval graphs and (assuming $p$ to be a constant) bounded-treewidth graphs.

Balancing graph Voronoi diagrams with one more vertex