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.
[BKMN16] Karl Bringmann, L´ aszl´ o Kozma, Shay Moran, and N
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2representative citing papers
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 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.