Rounding via trees: Deterministic approximation algorithms for group Steiner trees and k-median

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1998, Pages 114-123

  Charikar, Moses ^a   Chekuri, Chandra ^a   Goel, Ashish ^a   Guha, Sudipto ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PROBLEM SOLVING;

GROUP STEINER TREES;

TREES (MATHEMATICS);

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

References (24)