96 citations · 442 across the 64 of their papers we have counts for
Showing 2013 · cs.DSShow all
2 papers · 2 filters
cs.DS2013
Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems
Karl Bringmann, Christian Engels, Bodo Manthey +1
Probabilistic analysis for metric optimization problems has mostly been conducted on random Euclidean instances, but little is known about metric instances drawn from distributions…
cs.DS2013
Online Checkpointing with Improved Worst-Case Guarantees
Karl Bringmann, Benjamin Doerr, Adrian Neumann +1
In the online checkpointing problem, the task is to continuously maintain a set of k checkpoints that allow to rewind an ongoing computation faster than by a full restart. The only…