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 / 生醫電子與資訊學研究所
Polynomial time approximation scheme for minimum routing cost spanning trees
Details
Polynomial time approximation scheme for minimum routing cost spanning trees
Journal
Annual ACM-SIAM Symposium on Discrete Algorithms
Pages
21-32
Date Issued
1998
Author(s)
Wu, Bang Ye
Lancia, Giuseppe
Bafna, Vineet
Chao, Kun-Mao
Ravi, R.
Tang, Chuan Yi
KUN-MA0 CHAO
URI
http://www.scopus.com/inward/record.url?eid=2-s2.0-0032257797&partnerID=MN8TOARS
http://scholars.lib.ntu.edu.tw/handle/123456789/339646
Type
conference paper