Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue SIAM Journal on Computing Année : 2024

Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs

Fichier non déposé

Dates et versions

hal-04531446 , version 1 (03-04-2024)

Identifiants

Citer

Maria Chudnovsky, Marcin Pilipczuk, Michał Pilipczuk, Stéphan Thomassé. Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs. SIAM Journal on Computing, 2024, 53 (1), pp.47-86. ⟨10.1137/20M1333778⟩. ⟨hal-04531446⟩
10 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More