@article{ADTj10,
 abstract = {This paper approximately resolves the information flow over wireless (Gaussian) relay networks to within a constant number of bits. It introduced the linear deterministic model and established a max-flow min-cut result for linear deterministic networks. The insights from the deterministic approach led to the approximate max-flow min-cut characterization for noisy Gaussian networks, through the introduction of a new relaying
strategy called {\em quantize-map-forward} (QMF).},
 author = {S. Avestimehr and S N. Diggavi and D N C. Tse},
 file = {:papers:wirelessnetinfflow.pdf},
 journal = {IEEE Transactions on Information Theory},
 label = {adtj10},
 month = {April},
 note = {},
 number = {4},
 pages = {},
 tags = {journal,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow},
 title = {Wireless network information flow: a deterministic approach},
 type = {2},
 url_arxiv = {http://arxiv.org/abs/0906.5394},
 volume = {57},
 year = {2011}
}

{"_id":"SKfeJ2DDy5re8Nc8B","bibbaseid":"avestimehr-diggavi-tse-wirelessnetworkinformationflowadeterministicapproach-2011","author_short":["Avestimehr, S.","Diggavi, S N.","Tse, D N C."],"bibdata":{"bibtype":"article","type":"2","abstract":"This paper approximately resolves the information flow over wireless (Gaussian) relay networks to within a constant number of bits. It introduced the linear deterministic model and established a max-flow min-cut result for linear deterministic networks. The insights from the deterministic approach led to the approximate max-flow min-cut characterization for noisy Gaussian networks, through the introduction of a new relaying strategy called \\em quantize-map-forward (QMF).","author":[{"firstnames":["S."],"propositions":[],"lastnames":["Avestimehr"],"suffixes":[]},{"firstnames":["S","N."],"propositions":[],"lastnames":["Diggavi"],"suffixes":[]},{"firstnames":["D","N","C."],"propositions":[],"lastnames":["Tse"],"suffixes":[]}],"file":":papers:wirelessnetinfflow.pdf","journal":"IEEE Transactions on Information Theory","label":"adtj10","month":"April","note":"","number":"4","pages":"","tags":"journal,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow","title":"Wireless network information flow: a deterministic approach","url_arxiv":"http://arxiv.org/abs/0906.5394","volume":"57","year":"2011","bibtex":"@article{ADTj10,\n abstract = {This paper approximately resolves the information flow over wireless (Gaussian) relay networks to within a constant number of bits. It introduced the linear deterministic model and established a max-flow min-cut result for linear deterministic networks. The insights from the deterministic approach led to the approximate max-flow min-cut characterization for noisy Gaussian networks, through the introduction of a new relaying\nstrategy called {\\em quantize-map-forward} (QMF).},\n author = {S. Avestimehr and S N. Diggavi and D N C. Tse},\n file = {:papers:wirelessnetinfflow.pdf},\n journal = {IEEE Transactions on Information Theory},\n label = {adtj10},\n month = {April},\n note = {},\n number = {4},\n pages = {},\n tags = {journal,DetApprox,ITapprox,WiNet,IT,WiNetInfFlow},\n title = {Wireless network information flow: a deterministic approach},\n type = {2},\n url_arxiv = {http://arxiv.org/abs/0906.5394},\n volume = {57},\n year = {2011}\n}\n\n","author_short":["Avestimehr, S.","Diggavi, S N.","Tse, D N C."],"key":"ADTj10","id":"ADTj10","bibbaseid":"avestimehr-diggavi-tse-wirelessnetworkinformationflowadeterministicapproach-2011","role":"author","urls":{" arxiv":"http://arxiv.org/abs/0906.5394"},"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"https://bibbase.org/network/files/e2kjGxYgtBo8SWSbC","dataSources":["hicKnsKYNEFXC4CgH","jxCYzXXYRqw2fiEXQ","yuqM5ah4HMsTyDrMa","YaM87hGQiepg5qijZ","n9wmfkt5w8CPqCepg","soj2cS6PgG8NPmWGr","FaDBDiyFAJY5pL28h","ycfdiwWPzC2rE6H77"],"keywords":[],"search_terms":["wireless","network","information","flow","deterministic","approach","avestimehr","diggavi","tse"],"title":"Wireless network information flow: a deterministic approach","year":2011}