• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
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

Related items

Showing items related by title and author.

  • Thumbnail
    A note on the approximation ratio of graph-coloring 
    Paschos, Vangelis (2001) Article accepté pour publication ou publié
  • Thumbnail
    A generalization of König-Egervary graphs and heuristics for maximum independent set problem with improved approximation ratios 
    Paschos, Vangelis; Demange, Marc (1997) Article accepté pour publication ou publié
  • Thumbnail
    Reductions, completeness and the hardness of approximability 
    Ausiello, Giorgio; Paschos, Vangelis (2006) Article accepté pour publication ou publié
  • Thumbnail
    Constructive-non-constructive approximation and maximum independent set problem 
    Demange, Marc; Paschos, Vangelis (1996) Communication / Conférence
  • Thumbnail
    Purely combinatorial approximation algorithms for maximum k -vertex cover in bipartite graphs 
    Bonnet, Edouard; Escoffier, Bruno; Paschos, Vangelis; Stamoulis, Georgios (2018) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo