• 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 - No thumbnail

Local approximation for maximum H0-free partial subgraph problems

Monnot, Jérôme; Paschos, Vangelis; Toulouse, S. (2003), Local approximation for maximum H0-free partial subgraph problems, Operations Research Letter, 31, 3, p. 195-201

Type
Article accepté pour publication ou publié
External document link
https://hal.archives-ouvertes.fr/hal-00003926
Date
2003
Journal name
Operations Research Letter
Volume
31
Number
3
Pages
195-201
Metadata
Show full item record
Author(s)
Monnot, Jérôme cc
Paschos, Vangelis
Toulouse, S.
Abstract (EN)
We deal with max H0-free partial subgraph. We mainly prove that 3-locally optimal solutions achieve approximation ratio (d0+1)/(B+2+n0), where B is the maximum degree on G, d0 the minimum degree on H0, and n0 = (|V(H0)|+1)/d0. Next, we show that this ratio rises up to 3/(B+1) when H0 = K3. Finally, we provide hardness results for max K3-free partial subgraph.
Subjects / Keywords
Hereditary property; APX-complete; Maximum subgraph problem; Minimum vertex deletion problem; Aproximation algorithms; Local search

Related items

Showing items related by title and author.

  • Thumbnail
    Local approximations for maximum partial subgraph problem 
    Toulouse, Sophie; Paschos, Vangelis; Monnot, Jérôme (2004) Article accepté pour publication ou publié
  • Thumbnail
    Reoptimization of the Maximum Weighted Pk-Free Subgraph Problem under Vertex Insertion 
    Boria, Nicolas; Monnot, Jérôme; Paschos, Vangelis (2012) Communication / Conférence
  • Thumbnail
    Approximation polynomiale des problèmes NP-difficiles : optima locaux et rapport différentiel 
    Toulouse, Sophie; Paschos, Vangelis; Monnot, Jérôme (2003) Ouvrage
  • Thumbnail
    Approximation algorithms for the traveling salesman problem 
    Paschos, Vangelis; Monnot, Jérôme; Toulouse, Sophie (2003) Article accepté pour publication ou publié
  • Thumbnail
    Differential approximation results for the traveling salesman problem with distances 1 and 2 
    Toulouse, Sophie; Paschos, Vangelis; Monnot, Jérôme (2003) 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