Record number :
291538
Title of article :
A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
Author/Authors :
Bang Ye Wu، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2002
Pages :
20
From page :
359
To page :
378
Keywords :
Approximation algorithms , Spanning trees , PTAS , NP-hard
Journal title :
Journal of Algorithms
Serial Year :
2002
Link To Document :
بازگشت