3 citations · 5 across the 7 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DS2023★ 3 cited
A Better-Than-1.6-Approximation for Prize-Collecting TSP
Jannis Blauth, Nathan Klein, Martin Nägele
Prize-Collecting TSP is a variant of the traveling salesperson problem where one may drop vertices from the tour at the cost of vertex-dependent penalties. The quality of a solutio…
cs.DS2023
Thin trees for laminar families
Nathan Klein, Neil Olver
In the laminar-constrained spanning tree problem, the goal is to find a minimum-cost spanning tree which respects upper bounds on the number of times each cut in a given laminar fa…