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 Optimal Product-Requirement Communication Spanning Trees
Details
A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees
Journal
Journal of Algorithms
Journal Volume
36
Journal Issue
2
Pages
182-204
Date Issued
2000
Author(s)
Wu, B.Y.
Chao, K.-M.
Tang, C.Y.
KUN-MA0 CHAO
DOI
10.1006/jagm.2000.1088
URI
http://www.scopus.com/inward/record.url?eid=2-s2.0-0011243767&partnerID=MN8TOARS
http://scholars.lib.ntu.edu.tw/handle/123456789/289377
Type
journal article