Fully Dynamic Maintenance of Arc-Flags in Road Networks

@inproceedings{DAngelo2012FullyDM,
  title={Fully Dynamic Maintenance of Arc-Flags in Road Networks},
  author={Gianlorenzo D'Angelo and Mattia D'Emidio and Daniele Frigioni and Camillo Vitale},
  booktitle={SEA},
  year={2012}
}
The problem of finding best routes in road networks can be solved by applying Dijkstra’s shortest paths algorithm. Unfortunately, road networks deriving from real-world applications are huge yielding unsustainable times to compute shortest paths. For this reason, great research efforts have been done to accelerate Dijkstra’s algorithm on road networks. These efforts have led to the development of a number of speed-up techniques, as for example Arc-Flags, whose aim is to compute additional data… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…