摘要 : Many important network design problems are fundamentally combinatorial optimization problems. A large number of such problems, however, cannot readily be tackled by distributed algorithms. The Markov approximation framework studie... 展开
作者 | Chen M. Liew S.C. Shao Z. Kai C. |
---|---|
作者单位 | |
期刊名称 | 《IEEE Transactions on Information Theory》 |
页码/总页数 | 6301-6327 / 27 |
语种/中图分类号 | 英语 / TN91 |
关键词 | Combinatorial optimization Markov approximation distributed algorithms time-reversible Markov chains wireless networks |
DOI | 10.1109/TIT.2013.2268923 |
馆藏号 | IELEP0138 |