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

Computing the cut-set bound in half-duplex relay networks is a challengingoptimization problem, since it requires finding the cut-set optimal half-duplexschedule. This subproblem in general involves an exponential number ofvariables, since the number of ways to assign each node to either transmitteror receiver mode is exponential in the number of nodes. We present a generaltechnique that takes advantage of specific structures in the topology of agiven network and allows us to reduce the complexity of computing thehalf-duplex schedule that maximizes the cut-set bound (with i.i.d. inputdistribution). In certain classes of network topologies, our approach yieldspolynomial time algorithms. We use simulations to show running timeimprovements over alternative methods and compare the performance of varioushalf-duplex scheduling approaches in different SNR regimes.

On Min-Cut Algorithms for Half-Duplex Relay Networks