Improved space-time tradeoffs for TSP and permutation problems achieve S·T ≤ 3.7493^N via set systems with high chain efficiency, disproving a conjecture by Johnson, Leader and Russel.
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
CONDITIONAL 1representative citing papers
citing papers explorer
-
Improved Space-Time Tradeoffs for Permutation Problems via Extremal Combinatorics
Improved space-time tradeoffs for TSP and permutation problems achieve S·T ≤ 3.7493^N via set systems with high chain efficiency, disproving a conjecture by Johnson, Leader and Russel.