An Algorithmic Framework for Wireless Information Flow
We consider the wireless relay network model as introduced by Avestimehr, Diggavi and Tse for approximating Gaussian relay channels and show that it is a special case of a more abstract flow model that we introduce in this paper. This flow model is based on linking systems, a combinatorial structure...
Main Authors: | Goemans, Michel X., Iwata, Satoru, Zenklusen, Rico |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers
2011
|
Online Access: | http://hdl.handle.net/1721.1/60563 https://orcid.org/0000-0002-0520-1165 |
Similar Items
-
Deterministic network information flows using polylinking systems
by: Goemans, Michel X., et al.
Published: (2013) -
Matroids Are Immune to Braess’ Paradox
by: Fujishige, Satoru, et al.
Published: (2018) -
Matroids and integrality gaps for hypergraphic steiner tree relaxations
by: Goemans, Michel X., et al.
Published: (2013) -
Approximating Submodular Functions Everywhere
by: Goemans, Michel X., et al.
Published: (2011) -
A simple combinatorial algorithm for submodular function minimization
by: Iwata, Satoru, et al.
Published: (2011)