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

From MaRDI portal
Publication:6203477

DOI10.1137/20m1333778OpenAlexW4391998821MaRDI QIDQ6203477

Maria Chudnovsky, Steéphan Thomassé, Michał Pilipczuk, Marcin Pilipczuk

Publication date: 28 February 2024

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/20m1333778






Cites Work


This page was built for publication: Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs