The non-uniform Bounded Degree Minimum Diameter Spanning Tree problem with an application in P2P networking
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...
Saved in:
Main Authors: | Chawachat,J., Fakcharoenphol,J., Jindaluang,W. |
---|---|
格式: | Article |
出版: |
Elsevier
2015
|
主題: | |
在線閱讀: | http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84865840326&origin=inward http://cmuir.cmu.ac.th/handle/6653943832/38638 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
ALGORITMA GENETIK DENGAN CROSSOVER UNIFORM
UNTUK MASALAH DC-MST
(DEGREE CONSTRAINED MINIMUM SPANNING TREE)
由: WIWIN INDRIANI, 080012216
出版: (2005) -
Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model
由: Daniel Anderson, et al.
出版: (2020) -
NC algorithms for minimum sum of diameters clustering
由: Nopadon Juneam, et al.
出版: (2018) -
On minimum spanning trees and determinants
由: Sy, Mark Benlor B.
出版: (2002) -
On the parallel complexity of minimum sum of diameters clustering
由: Nopadon Juneam, et al.
出版: (2018)