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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Unit disk graphs are the set of graphs which represent the intersection ofdisk graphs and interval graphs. These graphs are of great importance due totheir structural similarity with wireless communication networks. Firefighterproblem on unit disk graph is interesting as it models the virus spreading inan wireless network and asks for a solution to stop it. In this paper, weconsider the MIN-BUDGET firefighter problem where the goal is to determine theminimum number of firefighters required and the nodes to place them at eachtime instant to save a given set of vertices of a given graph and a firebreakout node. We show that, the MIN-BUDGET firefighter problem in a unit diskgraph is NP-Hard. We also present a constant factor approximation algorithm.

Firefighter Problem with Minimum Budget: Hardness and Approximation Algorithm for Unit Disk Graphs