A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees

Resource

Journal of Algorithms,36,182-204.

Journal

Journal of Algorithms

Journal Issue

36

Pages

182-204

Date Issued

2000-03

Date

2000-03

Author(s)

Wu, B. Y.

Chao, K.-M.

Tang, C. Y.

URI

Type

journal article

File(s)

Name

92.pdf

Size

23.97 KB

Format

Adobe PDF

Checksum

(MD5):8b92f0586d0a5bf134cc6e0891f003f7