On approximation algorithms for the terminal Steiner tree problem

Drake, DE ORCID logoORCID: https://orcid.org/0000-0001-8767-4355 and Hougardy, S, 2004. On approximation algorithms for the terminal Steiner tree problem. Information Processing Letters, 89 (1), pp. 15-18. ISSN 0020-0190

Full text not available from this repository.
Item Type: Journal article
Publication Title: Information Processing Letters
Creators: Drake, D.E. and Hougardy, S.
Publisher: Elsevier BV
Date: January 2004
Volume: 89
Number: 1
ISSN: 0020-0190
Identifiers:
Number
Type
10.1016/j.ipl.2003.09.014
DOI
1849502
Other
Divisions: Schools > School of Science and Technology
Record created by: Jeremy Silvester
Date Added: 04 Jan 2024 15:45
Last Modified: 04 Jan 2024 15:45
URI: https://irep.ntu.ac.uk/id/eprint/50621

Actions (login required)

Edit View Edit View

Statistics

Views

Views per month over past year

Downloads

Downloads per month over past year