Multi-fragment algorithm: Difference between revisions
Content deleted Content added
remove deletion nomination; current version is okay from a copyright point of view. |
m stub sort |
||
| Line 17: | Line 17: | ||
<references /> |
<references /> |
||
{{uncategorized|date=November 2018}} |
{{uncategorized|date=November 2018}} |
||
| ⚫ | |||
| ⚫ | |||
Revision as of 08:22, 15 November 2018
| Class | Approximation algorithm |
|---|---|
| Data structure | Graph |
| Worst-case performance | |
| Optimal | No |
The multi-fragment (MF) algorithm is an heuristic or approximation algorithm for the travelling salesman problem (TSP) (and related problems). This algorithm is also sometimes called the "greedy algorithm" for the TSP.
The name "multi-fragment" comes from the fact that this algorithm constructs multiple intermediate partial tours (or "fragments") [1].
References
- ^ Johnson, David; A. McGeoch, Lyle (1997). "The Traveling Salesman Problem: A Case Study in Local Optimization". Local Search in Combinatorial Optimization. 1.
 | This article has not been added to any content categories. Please help out by adding categories to it so that it can be listed with similar articles, in addition to a stub category. (November 2018) |
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |