Cite Don's recent video on greedy permutation.

biblio/bibliography.bib

@@ -1387,3 +1387,21 @@ @misc{arxivpers1d
   year = {2023},
   copyright = {arXiv.org perpetual, non-exclusive license}
 }
+@InProceedings{chubet_et_al:LIPIcs.SoCG.2023.64,
+  author =	{Chubet, Oliver A. and Macnichol, Paul and Parikh, Parth and Sheehy, Donald R. and Sheth, Siddharth S.},
+  title =	{{Greedy Permutations and Finite Voronoi Diagrams}},
+  booktitle =	{39th International Symposium on Computational Geometry (SoCG 2023)},
+  pages =	{64:1--64:5},
+  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
+  ISBN =	{978-3-95977-273-0},
+  ISSN =	{1868-8969},
+  year =	{2023},
+  volume =	{258},
+  editor =	{Chambers, Erin W. and Gudmundsson, Joachim},
+  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
+  address =	{Dagstuhl, Germany},
+  URL =		{https://drops.dagstuhl.de/opus/volltexte/2023/17914},
+  URN =		{urn:nbn:de:0030-drops-179146},
+  doi =		{10.4230/LIPIcs.SoCG.2023.64},
+  annote =	{Keywords: greedy permutation, Voronoi diagrams}
+}

src/Subsampling/include/gudhi/choose_n_farthest_points.h

@@ -182,7 +182,7 @@ bool Compare_landmark_radius<FT>::operator()(std::size_t a, std::size_t b)const{
  *  This computes the same thing as `choose_n_farthest_points()`, but relies on the triangle
  *  inequality to reduce the amount of computation when the doubling dimension and spread are small.
  *  In the worst case, this can be much slower than `choose_n_farthest_points()` though.
- *  See \cite sheehy20onehop and its references for details about this algorithm.
+ *  See \cite chubet_et_al:LIPIcs.SoCG.2023.64 and its associated video for details about this algorithm.
  *  \tparam Distance must provide an operator() that takes 2 points (value type of the range)
  *  and returns their distance as a `double`. It must be a true metric (\a not squared Euclidean),
  *  the algorithm relies on the triangle inequality.