CINECA IRIS Institutional Research Information System
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishIn this paper, we report on our own experience in studying a fundamental problem on graphs: all pairs shortest paths. In particular, we discuss the interplay between theory and practice in engineering a simple variant of Dijkstra's shortest path algorithm. In this context, we show that studying heuristics that are efficient in practice can yield interesting clues to the combinatorial properties of the problem, and eventually lead to new theoretically efficient algorithms.
http://hdl.handle.net/11573/50579| Titolo: | Engineering shortest path algorithms |
| Autori interni: | DEMETRESCU, Camil |
| Data di pubblicazione: | 2004 |
| Rivista: | LECTURE NOTES IN COMPUTER SCIENCE |
| Abstract: | In this paper, we report on our own experience in studying a fundamental problem on graphs: all pairs shortest paths. In particular, we discuss the interplay between theory and practice in engineering a simple variant of Dijkstra's shortest path algorithm. In this context, we show that studying heuristics that are efficient in practice can yield interesting clues to the combinatorial properties of the problem, and eventually lead to new theoretically efficient algorithms. |
| Handle: | http://hdl.handle.net/11573/50579 |
| ISBN: | 9783540220671 9783540248385 |
| Appare nelle tipologie: | 04a Atto di comunicazione a congresso |
File in questo prodotto:
Copyright © 2017