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 paper proposes a new model for wireless relay networks referred to as “1-2-1 network”,
where two nodes can communicate only if they point “beams” at each other, otherwise no …

This paper studies networks that consist of N half-duplex relays assisting the communication
between a source and a destination. In ISIT'12 Brahma et al. conjectured that in Gaussian …

Computing optimal half-duplex schedules in Gaussian relay networks is a challenging
problem due to the lack of an exact capacity characterization and the large number of …

This paper studies the 1-2-1 half-duplex network model, where two half-duplex nodes can
communicate only if they point" beams" at each other; otherwise, no signal can be …

This paper explores the network simplification problem in the context of Gaussian half-
duplex diamond networks. Specifically, given an N-relay diamond network, this problem …

We consider an n-relay Gaussian diamond network where a source communicates to a
destination with the help of n half-duplex relays. Achieving rates close to the capacity of this …

In ISIT2012 Brahma, Özgür and Fragouli conjectured that in a half-duplex diamond relay
network (a Gaussian noise network without a direct source-destination link and with N non …

The Gomory-Hu tree is a popular optimization algorithm that enables to efficiently find a min-
cut (or equivalently, max-flow) for every pair of nodes in a graph. However, graphs cannot …

We consider the Gaussian diamond network where a source communicates with the
destination through n non-interfering half-duplex relays. The capacity of such networks …