Skip to content

Author

Xin-Rong Zheng

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Sep 2026

Near-Logarithmic Inapproximability of Parameterized Set Cover

It is shown that for every $\gamma=o(\frac{\log N}{\log\log N})$, $\gamma$-gap $k$-SetCover is W[1]-hard even when $d=O(k^{2}\gamma\log(k\gamma)) and $d^*=O(k\gamma)$.

Bing-Kai Lin, Xin-Rong Zheng · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.