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 a well-studied online random graph model for kidney exchange,where nodes representing patient-donor pairs arrive over time, and theprobability of a directed edge is p. We assume existence of a single altruisticdonor, who serves as a start node in this graph for a directed path ofdonations. The algorithmic problem is to select which donations to perform, andwhen, to minimize the amount of time that patients must wait before receiving akidney.  We advance our understanding of this setting by (1) providing efficient (infact, linear-time) algorithms with optimal O(1/p) expected waiting time, (2)showing that some of these algorithms in fact provide guarantees to allpatients of O(1/p) waiting time {\em with high probability}, (3) simplifyingprevious analysis of this problem, and (4) extending results to the case ofmultiple altruistic donors.

Kidney exchange and endless paths: On the optimal use of an altruistic donor