|
Volumn , Issue , 1998, Pages 260-269
|
New approximation algorithm for the planar augmentation problem
|
Author keywords
[No Author keywords available]
|
Indexed keywords
APPROXIMATION THEORY;
COMPUTATIONAL COMPLEXITY;
GRAPH THEORY;
PROBLEM SOLVING;
PLANAR AUGMENTATION PROBLEMS;
PLANAR GRAPHS;
ALGORITHMS;
|
EID: 0032278605
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (22)
|
References (21)
|