A Better Heuristic Algorithm for Finding the Closest Trio of 3-colored Points from a Given Set of 3-colored Points on a Plane

Ngoc-Trung Nguyen, Anh Duc Duong. A Better Heuristic Algorithm for Finding the Closest Trio of 3-colored Points from a Given Set of 3-colored Points on a Plane. Fundamenta Informaticae, 130(2):219-229, 2014. [doi]

@article{NguyenD14,
  title = {A Better Heuristic Algorithm for Finding the Closest Trio of 3-colored Points from a Given Set of 3-colored Points on a Plane},
  author = {Ngoc-Trung Nguyen and Anh Duc Duong},
  year = {2014},
  doi = {10.3233/FI-2014-989},
  url = {http://dx.doi.org/10.3233/FI-2014-989},
  researchr = {https://researchr.org/publication/NguyenD14},
  cites = {0},
  citedby = {0},
  journal = {Fundamenta Informaticae},
  volume = {130},
  number = {2},
  pages = {219-229},
}