Xuandi Ren

activity

20202026

most citedOn Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results

2 citations · 3 across the 14 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

cs.CC2021★ 1 cited

A Survey on Parameterized Inapproximability: $k$ -Clique, $k$ -SetCover, and More

Xuandi Ren

In the past a few years, many interesting inapproximability results have been obtained from the parameterized perspective. This article surveys some of such results, with a focus o…

cs.CC2021

On Lower Bounds of Approximating Parameterized $k$ -Clique

Bingkai Lin, Xuandi Ren, Yican Sun +1

Given a simple graph $G$ and an integer $k$ , the goal of $k$ -Clique problem is to decide if $G$ contains a complete subgraph of size $k$ . We say an algorithm approximates $k$ -Cliqu…

A Survey on Parameterized Inapproximability: k-Clique, k-SetCover, and More

On Lower Bounds of Approximating Parameterized k-Clique

A Survey on Parameterized Inapproximability: $k$ -Clique, $k$ -SetCover, and More

On Lower Bounds of Approximating Parameterized $k$ -Clique