A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees

Resource

SIAM Journal on Computing,29,761-778.

Journal

SIAM Journal on Computing

Journal Issue

29

Pages

761-778

Date Issued

2000-03

Date

2000-03

Author(s)

Wu, B. Y.

Lancia, G.

Bafna, V.

Chao, K.-M.

Ravi, R.

Tang, C. Y.

URI

Type

journal article

File(s)

Name

93.pdf

Size

23.14 KB

Format

Adobe PDF

Checksum

(MD5):a9ee91129b0ebdc7125edcf73981c5b1