Computing the Greedy Spanner in Near-Quadratic Time

Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid. Computing the Greedy Spanner in Near-Quadratic Time. In Joachim Gudmundsson, editor, Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings. Volume 5124 of Lecture Notes in Computer Science, pages 390-401, Springer, 2008. [doi]

@inproceedings{BoseCFMS08,
  title = {Computing the Greedy Spanner in Near-Quadratic Time},
  author = {Prosenjit Bose and Paz Carmi and Mohammad Farshi and Anil Maheshwari and Michiel H. M. Smid},
  year = {2008},
  doi = {10.1007/978-3-540-69903-3_35},
  url = {http://dx.doi.org/10.1007/978-3-540-69903-3_35},
  researchr = {https://researchr.org/publication/BoseCFMS08},
  cites = {0},
  citedby = {0},
  pages = {390-401},
  booktitle = {Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
  editor = {Joachim Gudmundsson},
  volume = {5124},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-69900-2},
}