Polylogarithmic approximation algorithm for the group Steiner tree problem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1998, Pages 253-259

  Garg, Naveen ^a   Konjevod, Goran ^a   Ravi, R ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; PROBLEM SOLVING; RANDOM PROCESSES; TREES (MATHEMATICS);

GROUP STEINER TREE PROBLEM;

ALGORITHMS;

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

References (23)