|
|
|
Volumn , Issue , 1997, Pages 21-29
|
|
When Hamming meets Euclid: The approximability of geometric TSP and MST
|
|
Author keywords
[No Author keywords available]
|
|
Indexed keywords
ALGORITHMS;
APPROXIMATION THEORY;
CODES (SYMBOLS);
COMPUTATIONAL COMPLEXITY;
ERROR CORRECTION;
PROBLEM SOLVING;
RANDOM PROCESSES;
THEOREM PROVING;
TREES (MATHEMATICS);
EUCLIDEAN METRICS;
HAMMING SPACES;
MINIMUM STEINER TREE PROBLEM (MST);
TRAVELING SALESPERSON PROBLEM (TSP);
OPTIMIZATION;
|
|
EID: 0030701251
PISSN: 07349025
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
|
Times cited : (22)
|
|
References (24)
|
