Login / Signup
Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs.
Maria Chudnovsky
Marcin Pilipczuk
Michal Pilipczuk
Stéphan Thomassé
Published in:
CoRR (2019)
Keyphrases
</>
independent set
approximation schemes
maximum weight
approximation algorithms
np hard
maximum independent set
bipartite graph
special case
weighted graph
minimum weight
worst case
partial order
computational complexity
link prediction
dynamic programming
lower bound
edge weights
social network analysis