3 citations · 6 across the 3 of their papers we have counts for
1 paper · 1 filter
Balázs F. Mezei, Marcin Wrochna, Stanislav Živný
We study polynomial-time approximation schemes (PTASes) for constraint satisfaction problems (CSPs) such as Maximum Independent Set or Minimum Vertex Cover on sparse graph classes.…