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

In this paper, we analyze the quality of a large class of simple dynamicresource allocation (DRA) strategies which we name priority planning. Their aimis to control an undesired diffusion process by distributing resources to thecontagious nodes of the network according to a predefined priority-order. Inour analysis, we reduce the DRA problem to the linear arrangement of the nodesof the network. Under this perspective, we shed light on the role of afundamental characteristic of this arrangement, the maximum cutwidth, forassessing the quality of any priority planning strategy. Our theoreticalanalysis validates the role of the maximum cutwidth by deriving bounds for theextinction time of the diffusion process. Finally, using the results of ouranalysis, we propose a novel and efficient DRA strategy, called MaximumCutwidth Minimization, that outperforms other competing strategies in oursimulations.

What Makes a Good Plan? An Efficient Planning Approach to Control Diffusion Processes in Networks