Fast Approximate Algorithm for the Single Source Shortest Path with Lazy Update

Tomohiro Takahashi, Yasuhiro Takashima. Fast Approximate Algorithm for the Single Source Shortest Path with Lazy Update. In 2018 New Generation of CAS, NGCAS 2018, Valletta, Malta, November 20-23, 2018. pages 94-97, IEEE, 2018. [doi]

@inproceedings{TakahashiT18-1,
  title = {Fast Approximate Algorithm for the Single Source Shortest Path with Lazy Update},
  author = {Tomohiro Takahashi and Yasuhiro Takashima},
  year = {2018},
  doi = {10.1109/NGCAS.2018.8572070},
  url = {https://doi.org/10.1109/NGCAS.2018.8572070},
  researchr = {https://researchr.org/publication/TakahashiT18-1},
  cites = {0},
  citedby = {0},
  pages = {94-97},
  booktitle = {2018 New Generation of CAS, NGCAS 2018, Valletta, Malta, November 20-23, 2018},
  publisher = {IEEE},
  isbn = {978-1-5386-7681-3},
}