|
|
|
Volumn , Issue , 1996, Pages 151-158
|
|
On the bit complexity of minimum link paths: superquadratic algorithms for problems solvable in linear time
a
|
|
Author keywords
[No Author keywords available]
|
|
Indexed keywords
ALGORITHMS;
APPROXIMATION THEORY;
COMPUTATIONAL COMPLEXITY;
COMPUTATIONAL METHODS;
MATHEMATICAL MODELS;
PROBLEM SOLVING;
LIMITED PRECISION APPROXIMATIONS;
LINEAR TIME ALGORITHMS;
MINIMUM LINK PATHS;
REAL RAM MODEL;
ROUNDING TECHNIQUES;
SIMPLE GREEDY ALGORITHM;
SUPERQUADRATIC ALGORITHMS;
COMPUTATIONAL GEOMETRY;
|
|
EID: 0029714758
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
|
Times cited : (8)
|
|
References (23)
|
