%0 Journal Article %1 journals/ijcmcst/MesrikhaniFI21 %A Mesrikhani, Amir %A Farshi, Mohammad %A Iranfar, Behnam %D 2021 %J Int. J. Comput. Math. Comput. Syst. Theory %K dblp %N 2 %P 130-136 %T A progressive algorithm for the closest pair problem. %U http://dblp.uni-trier.de/db/journals/ijcmcst/ijcmcst6.html#MesrikhaniFI21 %V 6

@article{journals/ijcmcst/MesrikhaniFI21, added-at = {2021-06-11T00:00:00.000+0200}, author = {Mesrikhani, Amir and Farshi, Mohammad and Iranfar, Behnam}, biburl = {https://www.bibsonomy.org/bibtex/293d4aed6b8f7b00d8f36c882ccf4d1e0/dblp}, ee = {https://doi.org/10.1080/23799927.2020.1862302}, interhash = {6b1c0625c19b66e2a8695395a1f26f8c}, intrahash = {93d4aed6b8f7b00d8f36c882ccf4d1e0}, journal = {Int. J. Comput. Math. Comput. Syst. Theory}, keywords = {dblp}, number = 2, pages = {130-136}, timestamp = {2024-04-08T20:07:23.000+0200}, title = {A progressive algorithm for the closest pair problem.}, url = {http://dblp.uni-trier.de/db/journals/ijcmcst/ijcmcst6.html#MesrikhaniFI21}, volume = 6, year = 2021 }