Skip to main content
English
中文
Log In
Log in
Log in with ORCID
NTU Single Sign On
Have you forgotten your password?
Home
College of Electrical Engineering and Computer Science / 電機資訊學院
Biomedical Electronics and Bioinformatics / 生醫電子與資訊學研究所
Approximation algorithms for the shortest total path length spanning tree problem
Details
Approximation algorithms for the shortest total path length spanning tree problem
Journal
Discrete Applied Mathematics
Journal Volume
105
Journal Issue
1-3
Pages
273-289
Date Issued
2000
Author(s)
Wu, B.Y.
Chao, K.-M.
Tang, C.Y.
KUN-MA0 CHAO
URI
http://www.scopus.com/inward/record.url?eid=2-s2.0-0011188480&partnerID=MN8TOARS
http://scholars.lib.ntu.edu.tw/handle/123456789/289374
Type
journal article
