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

researchr

You are not signed in
Sign in
Sign up

Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang. A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees. In SODA. pages 21-32, 1998.

This author has not been identified. Look up 'Bang Ye Wu' in GoogleThis author has not been identified. Look up 'Giuseppe Lancia' in GoogleThis author has not been identified. Look up 'Vineet Bafna' in GoogleThis author has not been identified. Look up 'Kun-Mao Chao' in GoogleThis author has not been identified. Look up 'R. Ravi' in GoogleThis author has not been identified. Look up 'Chuan Yi Tang' in Google

runs on WebDSL