From the 2 of 4 linked papers with an AI index.
4 papers
An optimal deterministic algorithm for finding a strict saddlepoint
Justin Dallant
Given an matrix , a saddlepoint of is an entry that is the maximum in its row and the minimum in its column. It is a strict saddlepoint if no other entry in its…
Quantum Space-Time Tradeoffs for TSP via Extremal Set Systems
Justin Dallant
The paper presents a quantum algorithm for the Traveling Salesman Problem that leverages extremal set systems and quantum minimum finding to achieve improved space–time tradeoffs c…
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…
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…