Approximating geometrical graphs via `spanners' and `banyans'

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1998, Pages 540-550

  Rao, Satish B ^a   Smith, Warren D ^a  

^a NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; SET THEORY; TREES (MATHEMATICS);

GRAPH SPANNERS; STEINER MINIMUM TREE;

COMPUTATIONAL COMPLEXITY;

EID: 0031634765     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/276698.276868     Document Type: Conference Paper

References (27)