| Display title | Christofides algorithm |
| Default sort key | Christofides algorithm |
| Page length (in bytes) | 12,399 |
| Namespace ID | 0 |
| Page ID | 3589536 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | Fewer than 30 watchers |
| Number of redirects to this page | 3 |
| Counted as a content page | Yes |
| Wikidata item ID | Q498144 |
| Local description | Approximation for the travelling salesman problem |
| Central description | algorithm that approximates solutions to the travellng salesman problem on a metric space, guaranteeing that its solutions will be within 1½ of the optimal solution length; discovered by Nicos Christofides in 1976 |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | Zyqqh (talk | contribs) |
| Date of page creation | 20:59, 1 January 2006 |
| Latest editor | Cedar101 (talk | contribs) |
| Date of latest edit | 06:43, 25 April 2025 |
| Total number of edits | 185 |
| Recent number of edits (within past 30 days) | 1 |
| Recent number of distinct authors | 1 |
| Hidden categories (4) | This page is a member of 4 hidden categories (help):
|
| Transcluded templates (45) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
