{"id":"https://openalex.org/keywords/christofides-algorithm","display_name":"Christofides algorithm","description":"The Christofides algorithm is a polynomial-time approximation algorithm for the metric travelling salesman problem with a 3/2 performance guarantee.","display_name_alternatives":["Christofides\u2013Serdyukov algorithm","Christofides approximation algorithm"],"ids":{"openalex":"https://openalex.org/keywords/christofides-algorithm","wikidata":"https://www.wikidata.org/wiki/Q498144"},"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5531,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5531,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.2396,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":189,"cited_by_count":3202,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/christofides-algorithm","updated_date":"2026-11-17T04:05:58","created_date":"2022-04-12T19:38:12"}
