Local approximation for maximum H0-free partial subgraph problems

Jérôme Monnot (1) , Vangelis Paschos Th (1) , Sophie Toulouse (1)

1 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision

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.

Mots clés: Aproximation algorithms; Local search; APX-complete; Maximum subgraph problem; Minimum vertex deletion problem; Hereditary property

Domaines: Algorithme et structure de données [cs.DS]; Optimisation et contrôle [math.OC]; Complexité [cs.CC]; Mathématique discrète [cs.DM]

Jérôme Monnot, Vangelis Paschos Th, Sophie Toulouse. Local approximation for maximum H0-free partial subgraph problems. Operations Research Letter, 2003, 31(3), pp.195-201. ⟨hal-00003926⟩