Date: 2016-05-24 11:28:44Graph theory Mathematics Computational complexity theory Operations research Combinatorial optimization Routing algorithms Search algorithms Edsger W. Dijkstra Travelling salesman problem A* search algorithm Flow network Tree traversal | | Approximation bounds for Black Hole Search problems? Ralf Klasing?? , Euripides Markou? ? ? , Tomasz Radzik† , Fabiano Sarracco‡ Abstract. A black hole is a highly harmful stationary process residing in a node of a nAdd to Reading ListSource URL: emarkou.users.uth.grDownload Document from Source Website File Size: 333,41 KBShare Document on Facebook
|