Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Daniel Anker Hermansen

Daniel Anker Hermansen

1 indexed paper

Recent (6 mo)
1
With code
0
Influential cites
0
Benchmarked
0

Publications per year

1
26

Top categories

Algorithms×1

Research Timeline

2026
Stochastic Online Euclidean TSP

This paper presents a deterministic algorithm achieving an expected competitive ratio of O(1) for Euclidean online TSP in high dimensions and O(log n) for d = 1, improving upon previous O(sqrt(n)) and O(log^2 n) results.

Highlighted terms show continued research focus across papers

Papers

cs.DSTheoreticalRecentJul 8, 2026

Stochastic Online Euclidean TSP

Daniel Anker Hermansen

This paper presents a deterministic algorithm achieving an expected competitive ratio of O(1) for Euclidean online TSP in high dimensions and O(log n) for d = 1, improving upon previous O(sqrt(n)) and…

View →