1 citations · 1 across the 5 of their papers we have counts for
5 papers
Efficient Approximations for Many-Visits Multiple Traveling Salesman Problems
Kristóf Bérczi, Matthias Mnich, Roland Vincze
A fundamental variant of the classical traveling salesman problem (TSP) is the so-called multiple TSP (mTSP), where a set of salesmen jointly visit all cities from a set of …
A 3/2-Approximation for the Metric Many-visits Path TSP
Kristóf Bérczi, Matthias Mnich, Roland Vincze
In the Many-visits Path TSP, we are given a set of cities along with their pairwise distances (or cost) , and moreover each city comes with an associated positive in…
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…
SciSports: Learning football kinematics through two-dimensional tracking data
Anatoliy Babic, Harshit Bansal, Gianluca Finocchio +7
SciSports is a Dutch startup company specializing in football analytics. This paper describes a joint research effort with SciSports, during the Study Group Mathematics with Indust…
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…