1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2023
A -Approximation for Multiple TSP with a Variable Number of Depots
Max Deppert, Matthias Kaul, Matthias Mnich
One of the most studied extensions of the famous Traveling Salesperson Problem (TSP) is the {\sc Multiple TSP}: a set of salespersons collectively traverses a set of …
cs.DS2021★ 1 cited
Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter
Parinya Chalermsook, Matthias Kaul, Matthias Mnich +3
The fundamental sparsest cut problem takes as input a graph together with the edge costs and demands, and seeks a cut that minimizes the ratio between the costs and demands acr…