Multi-fragment algorithm

This article may meet Wikipedia's criteria for speedy deletion as a copyright infringement^{(Copyvios report)} of https://link.springer.com/chapter/10.1007/978-3-319-52941-7_28 (Copyvios report) as well as http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.92.1635&rep=rep1&type=pdf (Copyvios report). This criterion applies only in unequivocal cases, where there is no free-content material on the page worth saving and no later edits requiring attribution – for more complicated situations, see Wikipedia:Copyright violations. See CSD G12.

If this article does not meet the criteria for speedy deletion, or you intend to fix it, please remove this notice, but do not remove this notice from pages that you have created yourself. If you created this page and you disagree with the given reason for deletion, you can click the button below and leave a message explaining why you believe it should not be deleted. You can also visit the talk page to check if you have received a response to your message.

Note that this article may be deleted at any time if it unquestionably meets the speedy deletion criteria, or if an explanation posted to the talk page is found to be insufficient.

Note to administrators: this article has content on its talk page which should be checked before deletion.

Note to administrators: If declining the request due to not meeting the criteria please consider whether there are still copyright problems with the page and if so, see these instructions for cleanup, or list it at Wikipedia:Copyright problems.

Please be sure that the source of the alleged copyright violation is not itself a Wikipedia mirror. Also, ensure the submitter of this page has been notified about our copyright policy.
Administrators: check links, talk, history (last), and logs before deletion. Consider checking Google.
This page was last edited by Nbro (contribs | logs) at 22:59, 13 November 2018 (UTC) (6 years ago)

Multi-fragment algorithm
Class	Approximation algorithm
Data structure	Graph
Worst-case performance	$\Theta (N^{2}\log N)$
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].

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. (November 2018)

^ Johnson, David; A. McGeoch, Lyle (1997). "The Traveling Salesman Problem: A Case Study in Local Optimization". Local Search in Combinatorial Optimization. 1.