Back to Results
First PageMeta Content
Graph theory / Mathematics / Computational complexity theory / NP-hard problems / NP-complete problems / Edsger W. Dijkstra / Combinatorial optimization / Approximation algorithms / Travelling salesman problem / Shortest path problem / Matching / Randomized algorithm


Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems∗ Karl Bringmann†1 , Christian Engels2 , Bodo Manthey3 , and B. V. Raghavendra Rao4 1
Add to Reading List

Document Date: 2016-01-03 06:48:33

Open Document

File Size: 363,10 KB

Share Result on Facebook