Searching for "A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
by Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang — 1998
…A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees Bang Ye Wu…
Cited by 35 (4 self) – Add To MetaCart

C.Y.: A polynomial-time approximation scheme for minimum routing cost spanning trees
by Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-mao Chao, R. Ravi, Chuan, Yi Tang — 1999 — SIAM J. Comput
…–778 A POLYNOMIAL-TIME APPROXIMATION SCHEME FOR MINIMUM ROUTING COST SPANNING TREES ∗ BANG YE WU…
Cited by 2 (0 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB