The non-uniform Bounded Degree Minimum Diameter Spanning Tree problem with an application in P2P networking

• المؤلفون الرئيسيون: Chawachat,J., Fakcharoenphol,J., Jindaluang,W.
• التنسيق: مقال
• منشور في: Elsevier 2015
• الموضوعات: Computer Science Applications; Information Systems; Signal Processing; Theoretical Computer Science
• الوصول للمادة أونلاين: http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84865840326&origin=inward; http://cmuir.cmu.ac.th/handle/6653943832/38638

This paper considers the Bounded Degree Minimum Diameter Spanning Tree problem (BDST problem) with non-uniform degree bounds. In this problem, we are given a metric length function ℓ over a set V of n nodes and a degree bound B v for each v∈V, and want to find a spanning tree with minimum diameter s...