activity
20152021
most citedAlgorithmic Aspects of Upper Domination

1 citations · 2 across the 3 of their papers we have counts for

collaborators
Showing cs.NEShow all

1 paper · 1 filter

cs.NE2020★ 1 cited

The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics

Jakob Bossek, Katrin Casel, Pascal Kerschke +1

Several important optimization problems in the area of vehicle routing can be seen as a variant of the classical Traveling Salesperson Problem (TSP). In the area of evolutionary co…