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


Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems Karl Bringmann1 , Christian Engels2 , Bodo Manthey3 , B. V. Raghavendra Rao4 1 Max Planck Institute for Informatics, .d
Add to Reading List

Document Date: 2016-01-03 06:46:12

Open Document

File Size: 360,44 KB

Share Result on Facebook