On the minimum routing cost clustered tree problem
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-016-0026-8
Abstract: For an edge-weighted graph $$G=(V,E,w)$$G=(V,E,w), in which the vertices are partitioned into k clusters $$\mathcal {R}=\{R_1,R_2,\ldots ,R_k\}$$R={R1,R2,…,Rk}, a spanning tree T of G is a clustered spanning tree if T can be cut into k… read more here.
Keywords: cost clustered; minimum routing; routing cost; cost ... See more keywords