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 / 生醫電子與資訊學研究所
A polynomial-time approximation scheme for minimum routing cost spanning trees
Details
A polynomial-time approximation scheme for minimum routing cost spanning trees
Journal
SIAM Journal on Computing
Journal Volume
29
Journal Issue
3
Pages
761-778
Date Issued
2000
Author(s)
Wu, B.Y.
Lancia, G.
Bafna, V.
Chao, K.-M.
Ravi, R.
Tang, C.Y.
KUN-MA0 CHAO
URI
http://www.scopus.com/inward/record.url?eid=2-s2.0-0033293966&partnerID=MN8TOARS
http://scholars.lib.ntu.edu.tw/handle/123456789/289376
Type
journal article
