Login / Signup
Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs.
Maria Chudnovsky
Marcin Pilipczuk
Michal Pilipczuk
Stéphan Thomassé
Published in:
SIAM J. Comput. (2024)
Keyphrases
</>
independent set
approximation schemes
maximum weight
approximation algorithms
np hard
maximum independent set
bipartite graph
minimum weight
weighted graph
special case
partial order
minimum cost
worst case
computational complexity
numerical methods
undirected graph
knapsack problem