• 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

Improved approximations for weighted and unweighted graph problems

Demange, Marc; Paschos, Vangelis (2005), Improved approximations for weighted and unweighted graph problems, Theory of Computing Systems, 38, 6, p. 763-787. http://dx.doi.org/10.1007/s00224-004-1162-6

Type
Article accepté pour publication ou publié
Date
2005
Journal name
Theory of Computing Systems
Volume
38
Number
6
Publisher
Springer
Pages
763-787
Publication identifier
http://dx.doi.org/10.1007/s00224-004-1162-6
Metadata
Show full item record
Author(s)
Demange, Marc
Paschos, Vangelis
Abstract (EN)
We obtain improved approximation ratios for problems of a broad class called weighted hereditary induced-subgraph maximization problems, in particular for the maximum independent set, maximum clique and maximum ℓ-colorable induced subgraph, as well as for the minimum coloring problem. We also study the minimum chromatic sum and show that its weighted version polynomially reduces to the weighted independent set problem in such a way that approximation ratios are preserved (up to a multiplicative constant).
Subjects / Keywords
Minimum chromatic sum; Minimum coloring problem; Maximum clique; Maximum independant set

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
    Weighted coloring on planar, bipartite and split graphs: complexity and improved approximation 
    de Werra, Dominique; Demange, Marc; Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis (2004) Communication / Conférence
  • Thumbnail
    Complexity and approximation results for the min weighted node coloring problem 
    Escoffier, Bruno; Demange, Marc; Paschos, Vangelis; de Werra, Dominique; Monnot, Jérôme (2008) Chapitre d'ouvrage
  • Thumbnail
    Weighted coloring on planar, bipartite and split graphs: complexity and approximation 
    Paschos, Vangelis; Monnot, Jérôme; Escoffier, Bruno; Demange, Marc; de Werra, Dominique (2009) Article accepté pour publication ou publié
  • Thumbnail
    Approximation results for the minimum graph coloring problem 
    Paschos, Vangelis; Grisoni, Pascal; Demange, Marc (1994) 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