2 papers
cs.DS2019
Probabilistic Analysis of Facility Location on Random Shortest Path Metrics
Stefan Klootwijk, Bodo Manthey
The facility location problem is an NP-hard optimization problem. Therefore, approximation algorithms are often used to solve large instances. Such algorithms often perform much be…
cs.DS2018
Probabilistic Analysis of Optimization Problems on Generalized Random Shortest Path Metrics
Stefan Klootwijk, Bodo Manthey, Sander K. Visser
Simple heuristics often show a remarkable performance in practice for optimization problems. Worst-case analysis often falls short of explaining this performance. Because of this,…