![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 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](https://www.pdfsearch.io/img/df659750d7f73d539655c7d628103700.jpg) Date: 2016-01-03 06:48:33Graph 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 1Add to Reading ListSource URL: people.mpi-inf.mpg.deDownload Document from Source Website File Size: 363,10 KBShare Document on Facebook
|