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

We consider the P2P orienteering problem on general metrics and present a(2+{\epsilon}) approximation algorithm. In the stochastic P2P orienteeringproblem we are given a metric and each node has a fixed reward and random size.The goal is to devise a strategy for visiting the nodes so as to maximize theexpected value of the reward without violating the budget constraints. Wepresent an approximation algorithm for the non-adaptive variant of the P2PStochastic orienteering. As an implication of the approximation to thestochastic P2P orienteering problem, we define a stochastic vehicle routingproblem with time-windows and present a constant factor approximation solution.

Approximation Algorithms for P2P Orienteering and Stochastic Vehicle Routing Problem