• 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

A note on the improvement of the maximum independent set's approximation ratio

Paschos, Vangelis (1995), A note on the improvement of the maximum independent set's approximation ratio, Yugoslav Journal of Operations Research, 5, 1

Type
Article accepté pour publication ou publié
Date
1995
Journal name
Yugoslav Journal of Operations Research
Volume
5
Number
1
Publisher
University of Belgrad, Faculty of Organizational Sciences, et. al
Metadata
Show full item record
Author(s)
Paschos, Vangelis
Subjects / Keywords
Recherche opérationnelle

Related items

Showing items related by title and author.

  • 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
    A (°/2)-approximation algorithm for the maximum independent set problem 
    Paschos, Vangelis (1992) Article accepté pour publication ou publié
  • Thumbnail
    A relation between the approximated versions of minimum set covering, minimum vertex covering and maximum independent set 
    Paschos, Vangelis (1994) Article accepté pour publication ou publié
  • Thumbnail
    The approximability behavior of some combinatorial problems with respect to the approximability of a class of maximum independent set problems 
    Demange, Marc; Paschos, Vangelis (1997) Article accepté pour publication ou publié
  • Thumbnail
    Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $\mathcal{G}(n,p)$ random model 
    Bourgeois, N.; Catellier, Rémi; Denat, T.; Paschos, Vangelis (2015) Document de travail / Working paper
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