Designing networks with bounded pairwise distance

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1999, Pages 750-759

  Dodis, Yevgeniy ^a   Khanna, Sanjeev ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; LINEAR PROGRAMMING; PROBLEM SOLVING; SET THEORY; TELECOMMUNICATION LINKS; TELECOMMUNICATION NETWORKS;

APPROXIMATION ALGORITHM; DIRECTED GENERALIZED STEINER NETWORK;

COMPUTATIONAL COMPLEXITY;

EID: 0032663833     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Article

References (0)