• 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 (°/2)-approximation algorithm for the maximum independent set problem

Paschos, Vangelis (1992), A (°/2)-approximation algorithm for the maximum independent set problem, Information Processing Letters, 44, 1, p. 11-13. http://dx.doi.org/10.1016/0020-0190(92)90248-T

Type
Article accepté pour publication ou publié
Date
1992
Journal name
Information Processing Letters
Volume
44
Number
1
Publisher
Elsevier
Pages
11-13
Publication identifier
http://dx.doi.org/10.1016/0020-0190(92)90248-T
Metadata
Show full item record
Author(s)
Paschos, Vangelis
Abstract (EN)
We show how we can improve the approximation ratio for the independent set problem on a graph. We obtain thus an approximation ratio asymptotically equal to δ/2, in place of δ−1, where δ is the maximum degree of the graph.
Subjects / Keywords
computational complexity; independent set; combinatorial problems; analysis of algorithms; Approximation algorithms

Related items

Showing items related by title and author.

  • Thumbnail
    A natural model and a parallel algorithm for approximately solving the maximum weighted independent set problem 
    Afif, Mohamed; Likas, Aris; Paschos, Vangelis (1995) 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
    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
  • Thumbnail
    Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems 
    Bonnet, Édouard; Paschos, Vangelis; Sikora, Florian (2016) Article accepté pour publication ou publié
  • Thumbnail
    A priori optimization for the probabilistic maximum independent set problem 
    Murat, Cécile; Paschos, Vangelis (2002) 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