دورية أكاديمية
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
العنوان: | A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees |
---|---|
المؤلفون: | Ye Wu, Bang, Lancia, Giuseppe, Bafna, Vineet, Choa, Kun-Mao, Ravi, R., Yi Tang, Chuan |
المصدر: | SIAM Journal on Computing. 1999, Vol. 29 Issue 3, p761. 18p. |
قاعدة البيانات: | Business Source Index |
تدمد: | 00975397 |
---|