3 ms·
Did the optimal algorithm for dijkstas shortest path mentioned in the article get used for something immediately consequential and very time sensitive?. My intu
by ghm2180 2y ago
Did the optimal algorithm for dijkstas shortest path mentioned in the article get used for something immediately consequential and very time sensitive?. My intuition would think routing internet traffic could be a good us case, but I may be wrong.
- nickcw 2y agoDijkstra's algorithm is used in the OSPF routing protocol which used to route traffic around large networks (think ISP internal network, or a large Enterprise).
- _kb 2y agoIt was part of a tech demo for a research computer, in 1956, intentionally designed to show an easily visualisable problem domain - road connections between cities. That’s over a decade before ARPANET existed. There’s an interview here with more: https://dl.acm.org/doi/pdf/10.1145/1787234.1787249 https://dl.acm.org/doi/pdf/10.1145/1787234.1787249
- mcherm 2y agoThe article on it [1] says that, "The new result probably won’t have such practical applications, for which there are many considerations beyond theoretical optimality guarantees." [1] https://www.quantamagazine.org/computer-scientists-establish-the-best-way-to-traverse-a-graph-20241025/ https://www.quantamagazine.org/computer-scientists-establish...