Approximation algorithms for directed Steiner problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1998, Pages 192-200

  Charikar, Moses ^a   Chekuri, Chandra ^a   Cheung, To yat ^a   Dai, Zuo ^a   Goel, Ashish ^a   Guha, Sudipto ^a   Li, Ming ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; MULTICASTING; POLYNOMIALS; TRAVELING SALESMAN PROBLEM; TREES (MATHEMATICS);

NONTRIVIAL APPROXIMATION ALGORITHMS; STEINER TREE PROBLEMS;

ALGORITHMS;

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

References (25)