In computational geometry, the farthest-first traversal of a compact metric space is a sequence of points in which the first point is chosen arbitrarily and each following point is chosen to be as far as possible from all previously selected points. The technique produces a widely spaced set of points and is used in approximation algorithms for problems such as the traveling salesman problem and the metric k-center clustering problem. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Classification
Design TechniqueHeuristic or Approximation 1 Sources
1. Wikipedia: Farthest-first traversal
entity record, description (design-technique)Quote, entity record, description (design-technique)
The technique produces a widely spaced set of points and is used in approximation algorithms for problems such as the traveling salesman problem and the metric k-center clustering problem.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.