|
Volumn , Issue , 2000, Pages 166-175
|
When crossings count - approximating the minimum spanning tree
a a |
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
APPROXIMATION THEORY;
COMPUTATIONAL COMPLEXITY;
OPTIMIZATION;
TREES (MATHEMATICS);
MINIMUM SPANNING TREE;
COMPUTATIONAL GEOMETRY;
|
EID: 0033718033
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/336154.336197 Document Type: Conference Paper |
Times cited : (9)
|
References (19)
|