Establishes strong NP-hardness for unary translocation distance and gives 2-approximation, additive approximation, parameterized algorithms, and an ILP formulation.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Complexity and Algorithms for Unary Translocation Distance
Establishes strong NP-hardness for unary translocation distance and gives 2-approximation, additive approximation, parameterized algorithms, and an ILP formulation.