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

For the problem of delivering a package from a source node to a destinationnode in a graph using a set of drones, we study the setting where the movementsof each drone are restricted to a certain subgraph of the given graph. Weconsider the objectives of minimizing the delivery time (problem DDT) and ofminimizing the total energy consumption (problem DDC). For general graphs, weshow a strong inapproximability result and a matching approximation algorithmfor DDT as well as NP-hardness and a 2-approximation algorithm for DDC. For thespecial case of a path, we show that DDT is NP-hard if the drones havedifferent speeds. For trees, we give optimal algorithms under the assumptionthat all drones have the same speed or the same energy consumption rate. Theresults for trees extend to arbitrary graphs if the subgraph of each drone isisometric.

Package Delivery Using Drones with Restricted Movement Areas