Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H -free graphs

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Maria Chudnovsky; Marcin Pilipczuk; Michał Pilipczuk; Stéphan Thomassé

Journal title: ACM-SIAM Symposium on Discrete Algorithms (SODA 2020)

Journal publisher: ACM

Published year: 2020

DOI identifier: 10.1137/1.9781611975994.139