Under ETH, no f(k) n^{o(k/log k)}-time algorithm can approximate k-permutation pattern counts within n^{(1/2-ε)k} factor, matching exact-counting hardness.
[JK17] V´ ıt Jel´ ınek and Jan Kyncl
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3representative citing papers
Graphs of bounded VC-dimension have sub-linear twin-width, shown via a new contraction tool on neighborhood partitions, plus tighter bounds for interval graphs.
Incremental k-center clustering admits no better than 2-approximation even for non-polynomial algorithms, via a new lower-bound construction.
citing papers explorer
-
Inapproximability of Counting Permutation Patterns
Under ETH, no f(k) n^{o(k/log k)}-time algorithm can approximate k-permutation pattern counts within n^{(1/2-ε)k} factor, matching exact-counting hardness.
-
The Twin-Width of Graphs of Bounded VC-Dimension
Graphs of bounded VC-dimension have sub-linear twin-width, shown via a new contraction tool on neighborhood partitions, plus tighter bounds for interval graphs.
-
The price of incrementality in k-center clustering
Incremental k-center clustering admits no better than 2-approximation even for non-polynomial algorithms, via a new lower-bound construction.