• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Local approximation for maximum H0-free partial subgraph problems

Thumbnail
Date
2003
Link to item file
https://hal.archives-ouvertes.fr/hal-00003926
Dewey
Programmation, logiciels, organisation des données
Sujet
Hereditary property; APX-complete; Maximum subgraph problem; Minimum vertex deletion problem; Aproximation algorithms; Local search
Journal issue
Operations Research Letter
Volume
31
Number
3
Publication date
2003
Article pages
195-201
URI
https://basepub.dauphine.fr/handle/123456789/20747
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Monnot, Jérôme
Paschos, Vangelis
Toulouse, S.
Type
Article accepté pour publication ou publié
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.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.