Exploring Endless Space
From MaRDI portal
Publication:6166765
Recommendations
Cites work
- scientific article; zbMATH DE number 3918121 (Why is no real title available?)
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Generating Random Networks and Graphs
- In pursuit of the traveling salesman. Mathematics at the limits of computation
- Introduction to Random Graphs
- Introduction to algorithms.
- Networks
- On the nearest neighbor rule for the metric traveling salesman problem
- On the nearest neighbor rule for the traveling salesman problem
- Online graph exploration: New results on old and new algorithms
- Random graphs and complex networks. Volume 1
- THE NEAREST UNVISITED VERTEX WALK ON RANDOM GRAPHS
- The unfinished game. Pascal, Fermat, and the seventeenth-century letter that made the world modern. A tale of how mathematics is really done
Cited in
(3)
This page was built for publication: Exploring Endless Space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166765)