Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Hieu, Ly Trung"'
Minimum Routing Cost Clustered Tree Problem (CluMRCT) is applied in various fields in both theory and application. Because the CluMRCT is NP-Hard, the approximate approaches are suitable to find the solution for this problem. Recently, Multifactorial
Externí odkaz:
http://arxiv.org/abs/1912.10986
