Polynomial time approximation scheme for minimum routing cost spanning trees

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1998, Pages 21-32

  Wu, Bang Ye ^a   Lancia, Giuseppe ^a   Bafna, Vineet ^a   Chao, Kun Mao ^a   Ravi, R ^a   Tang, Chuan Yi ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING;

POLYNOMIAL TIME APPROXIMATION SCHEMES; SPANNING TREES;

TREES (MATHEMATICS);

EID: 0032257797     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)