Deterministic network information flows using polylinking systems
Motivated by the deterministic wireless information flow model introduced by Avestimehr, Diggavi and Tse, we introduce a deterministic flow model based on combining polylinking systems, a notion introduced by Schrijver and closely related to polymatroids. Given is a set of vertices that can be parti...
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 (IEEE)
2013
|
Online Access: | http://hdl.handle.net/1721.1/80851 https://orcid.org/0000-0002-0520-1165 |
Similar Items
-
An Algorithmic Framework for Wireless Information Flow
by: Goemans, Michel X., et al.
Published: (2011) -
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) -
An adaptive routing approach for personal rapid transit
by: Schüpbach, Kaspar, et al.
Published: (2016)