Shuichi Hirahara

activity

20232026

most citedProbabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems

3 citations · 5 across the 7 of their papers we have counts for

collaborators

Showing 2024Show all

2 papers · 1 filter

cs.CC2024

Asymptotically Optimal Inapproximability of Maxmin $k$ -Cut Reconfiguration

Shuichi Hirahara, Naoto Ohsaka

$k$ -Coloring Reconfiguration is one of the most well-studied reconfiguration problems, which asks to transform a given proper $k$ -coloring of a graph to another by repeatedly recol…

cs.CC2024★ 2 cited

Optimal PSPACE-hardness of Approximating Set Cover Reconfiguration

Shuichi Hirahara, Naoto Ohsaka

In the Minmax Set Cover Reconfiguration problem, given a set system $F$ over a universe and its two covers $C^{start}$ and $C^{goal}$ of…

Asymptotically Optimal Inapproximability of Maxmin k-Cut Reconfiguration

Optimal PSPACE-hardness of Approximating Set Cover Reconfiguration

Asymptotically Optimal Inapproximability of Maxmin $k$ -Cut Reconfiguration