Almost Tight Oracles for Fastest-Path Queries on Temporal Trees

Davide Bilò, Luciano Gualà, Stefano Leucci 0001, Guido Proietti, Alessandro Straziota. Almost Tight Oracles for Fastest-Path Queries on Temporal Trees. In Othon Michail, Giuseppe Prencipe, editors, Algorithmics of Wireless Networks - 21st International Symposium, ALGOWIN 2025, Warsaw, Poland, September 18-19, 2025, Proceedings. Volume 16078 of Lecture Notes in Computer Science, pages 61-75, Springer, 2025. [doi]

@inproceedings{BiloGLPS25,
  title = {Almost Tight Oracles for Fastest-Path Queries on Temporal Trees},
  author = {Davide Bilò and Luciano Gualà and Stefano Leucci 0001 and Guido Proietti and Alessandro Straziota},
  year = {2025},
  doi = {10.1007/978-3-032-09120-8_5},
  url = {https://doi.org/10.1007/978-3-032-09120-8_5},
  researchr = {https://researchr.org/publication/BiloGLPS25},
  cites = {0},
  citedby = {0},
  pages = {61-75},
  booktitle = {Algorithmics of Wireless Networks - 21st International Symposium, ALGOWIN 2025, Warsaw, Poland, September 18-19, 2025, Proceedings},
  editor = {Othon Michail and Giuseppe Prencipe},
  volume = {16078},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-032-09120-8},
}