Algorithms for the optimum communication spanning tree problem
From MaRDI portal
Publication:2507388
DOI10.1007/s10479-006-7382-1zbMath1101.90058MaRDI QIDQ2507388
Publication date: 11 October 2006
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-006-7382-1
cut-tree; adjacent basic feasible solution; adjacent spanning tree; cost of communication; star-tree
Related Items
Cites Work