[机翻] 组合网络优化的马尔可夫逼近
    [期刊]
  • 《IEEE Transactions on Information Theory》 2013年59卷10期

摘要 : 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... 展开

相关作者
相关关键词