Manuel Lafond
  • Member for 7 years
  • Last seen more than a month ago
1 answers
9 votes
541 views
1 bookmarks
Hardness of approximating Minimum Cardinality Exact Cover
2 answers
5 votes
409 views
1 bookmarks
Approximation ratio when optimal solution is $0$
0 answers
4 votes
36 views
1 bookmarks
Finding the "most modular" subset of graph vertices, i.e. that minimize disagreement inside and outside
1 answers
3 votes
848 views
2 bookmarks
Time complexity of computing binomial coefficients (with binary representation of integers)
1 answers
3 votes
252 views
1 bookmarks
Number of words within Hamming distance $\delta$
2 answers
3 votes
174 views
Hardness of approximation: what decision problem is hard exactly?
2 answers
2 votes
347 views
Is $k$-CLIQUE W[1]-hard for parameter $n - k$?
0 answers
2 votes
264 views
Is Max-2SAT with exactly 3 occurrences per variable APX-hard?
1 answers
1 votes
1k views
ILP and number of variables in constraints
1 answers
1 votes
80 views
W[1]-hardness of Steiner tree w.r.t. number of non-terminal vertices