dynamic programming 1entropy methods 1extremal combinatorics 1set systems 1space-time tradeoff 1traveling salesman problem 1
From the 1 of 2 linked papers with an AI index.
2 papers
cs.DS2026
Optimal chain density, entropy, and space-time tradeoffs for the TSP
Alexandr Andoni, Justin Dallant, László Kozma +1
The paper determines the optimal trade‑off between the size of a set system and its full‑chain density, yielding a near‑optimal constant γ≈3.1819 that governs the space‑time produc…
cs.DS2026
Improved space-time tradeoff for TSP via extremal set systems
Justin Dallant, László Kozma
The traveling salesman problem (TSP) is a cornerstone of combinatorial optimization and has deeply influenced the development of algorithmic techniques in both exact and approximat…