1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.DM2019★ 1 cited
Degree-Bounded Generalized Polymatroids and Approximating the Metric Many-Visits TSP
Kristóf Bérczi, André Berger, Matthias Mnich +1
In the Bounded Degree Matroid Basis Problem, we are given a matroid and a hypergraph on the same ground set, together with costs for the elements of that set as well as lower and u…
cs.DS2018
A time- and space-optimal algorithm for the many-visits TSP
André Berger, László Kozma, Matthias Mnich +1
The many-visits traveling salesperson problem (MV-TSP) asks for an optimal tour of cities that visits each city a prescribed number of times. Travel costs may be asym…