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
2000Journal name
Bulletin of the Greek Mathematical SocietyVolume
43Publisher
Greek Mathematical Society
Pages
37-54
Metadata
Show full item recordAuthor(s)
Paschos, VangelisSubjects / Keywords
Combinatorial programming; Approximation algorithms; Graph theory in connection with computer science; Computational difficulty of problems; Analysis of algorithms and problem complexityRelated items
Showing items related by title and author.
-
Paschos, Vangelis (2001) Article accepté pour publication ou publié
-
Paschos, Vangelis; Demange, Marc (1997) Article accepté pour publication ou publié
-
Ausiello, Giorgio; Paschos, Vangelis (2006) Article accepté pour publication ou publié
-
Demange, Marc; Paschos, Vangelis (1996) Communication / Conférence
-
Bonnet, Edouard; Escoffier, Bruno; Paschos, Vangelis; Stamoulis, Georgios (2018) Article accepté pour publication ou publié