|
Volumn , Issue , 1998, Pages 211-218
|
New approximation techniques for some ordering problems
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
COMPUTATIONAL COMPLEXITY;
GRAPH THEORY;
OPTIMIZATION;
PROBLEM SOLVING;
ORDERING PROBLEMS;
APPROXIMATION THEORY;
|
EID: 0032258738
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (54)
|
References (13)
|