Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs
From MaRDI portal
Publication:5146928
DOI10.1137/1.9781611975994.139MaRDI QIDQ5146928
Marcin Pilipczuk, Maria Chudnovsky, Michał Pilipczuk, Steéphan Thomassé
Publication date: 2 February 2021
Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.04585
68Wxx: Algorithms in computer science