Sublinear time algorithms for metric space problems

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1999, Pages 428-434

  Indyk, Piotr ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; TRAVELING SALESMAN PROBLEM; TREES (MATHEMATICS);

METRIC SPACES; SUBLINEAR TIME ALGORITHMS;

COMPUTATIONAL COMPLEXITY;

EID: 0032674516     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/301250.301366     Document Type: Article

References (19)