Thumbnail - Request a copy

Studying graph-stability to apprehend relative hardness of constructive -non constructive approximation

Paschos, Vangelis (2000), Studying graph-stability to apprehend relative hardness of constructive -non constructive approximation, Bulletin of the Greek Mathematical Society, 43, p. 37-54

Type
Article accepté pour publication ou publié
Date
2000
Journal name
Bulletin of the Greek Mathematical Society
Volume
43
Publisher
Greek Mathematical Society
Pages
37-54
Metadata
Show full item record
Author(s)
Paschos, Vangelis
Subjects / Keywords
Combinatorial programming; Approximation algorithms; Graph theory in connection with computer science; Computational difficulty of problems; Analysis of algorithms and problem complexity