Gap amplification for reconfiguration problems

DOI10.1137/1.9781611977912.54MaRDI QIDQ6645409zbMATH OpenFDO

Authors Naoto Ohsaka

Publication date 28 November 2024

Full work available at URL https://doi.org/10.1137/1.9781611977912.54

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(7)

• Gap preserving reductions between reconfiguration problems
• Complexity of action path finding with small precondition sets
• Alphabet reduction for reconfiguration problems
• Optimal PSPACE-hardness of approximating set cover reconfiguration
• On approximate reconfigurability of label cover
• Tight inapproximability of target set reconfiguration
• Asymptotically optimal inapproximability of maxmin k-cut reconfiguration

This page was built for publication: Gap amplification for reconfiguration problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6645409)