Recently, it has been shown that a quantize-map-and-forward scheme approximately
achieves (within a constant number of bits) the Gaussian relay network capacity for arbitrary …

Short message noisy network coding (SNNC) differs from long message noisy network
coding (LNNC) in that one transmits many short messages in blocks rather than using one …

Abstract In [1], a new relaying strategy, quantize-map-and-forward (QMF) scheme, has been
demonstrated to approximately achieve (within an additive constant number of bits) the …

We consider the-relay Gaussian diamond network where a source node communicates to a
destination node via parallel relays through a cascade of a Gaussian broadcast (BC) and a …

We consider the Gaussian N-relay diamond network, where a source wants to communicate
to destination node through a layer of N-relay nodes. We investigate the following question …

This monograph illustrates a novel approach, which is based on changing the focus to seek
approximate solutions accompanied by universal guarantees on the gap to optimality, in …

We consider multicommodity flow and cut problems in polymatroidal networks where there
are submodular capacity constraints on the edges incident to a node. Polymatroidal …

The capacity or approximations to capacity of various single-source single-destination relay
network models has been characterized in terms of the cut-set upper bound. In principle, a …

Consider a Gaussian relay network where a source node communicates to a destination
node with the help of several layers of relays. Recent work has shown that compress-and …

Recently, a new relaying strategy, quantize-map-and-forward (QMF) scheme, has been
demonstrated to approximately achieve (within an additive constant number of bits) the …