2 citations · 3 across the 8 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2025
Balanced TSP partitioning
Benjamin Aram Berendsohn, Hwi Kim, László Kozma
The traveling salesman problem (TSP) famously asks for a shortest tour that a salesperson can take to visit a given set of cities in any order. In this paper, we ask how much faste…
cs.CG2020
Geometric group testing
Benjamin Aram Berendsohn, László Kozma
Group testing is concerned with identifying defective items in a set of items, where each test reports whether a specific subset of items contains at least one defective. I…