Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
The Price of Almost Navigability
Tomer Waizer, Yoav Danieli
Navigability is a fundamental property of graph-based search structures and plays an important role in the analysis of nearest-neighbor algorithms. Informally, a graph is navigable…
cs.DS2026
Mind the Gap. Doubling Constant Parametrization of Weighted Problems: TSP, Max-Cut, and More
Mihail Stoian
Despite much research, hard weighted problems still resist super-polynomial improvements over their textbook solution. On the other hand, the unweighted versions of these problems…