A polynomial-time approximation scheme for minimum routing cost spanning trees

Wu, B.Y.B.Y.WuLancia, G.G.LanciaBafna, V.V.BafnaChao, K.-M.K.-M.ChaoRavi, R.R.RaviTang, C.Y.C.Y.TangKUN-MA0 CHAO2018-09-102018-09-102000http://www.scopus.com/inward/record.url?eid=2-s2.0-0033293966&partnerID=MN8TOARShttp://scholars.lib.ntu.edu.tw/handle/123456789/289376A polynomial-time approximation scheme for minimum routing cost spanning treesjournal article