Christofides algorithm
flowchart AA["Associated Authors (0)"] C[Christofides algorithm] BC["Broader Concepts (2)"] NC["Narrower Concepts (0)"] C== skos:broader ==>BC NC== skos:broader ==>C AA== dcterms:relation ==>C click BC "#broader-concepts" click NC "#narrower-concepts" click AA "#associated-authors" NI["add incoming edge"] NO["add outgoing edge"] NI-- ? -->C C-- ? -->NO click NI "#add-incoming-edge" click NO "#add-outgoing-edge" style NI stroke-width:2px,stroke-dasharray: 5 5 style NO stroke-width:2px,stroke-dasharray: 5 5
- Wikidata
- https://www.wikidata.org/wiki/Q498144
- OpenAlex ID
- https://openalex.org/C138600008 (API record)
- OpenAlex 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
- OpenAlex Level [?]
- 4
Broader Concepts
Narrower Concepts
Associated Authors
Add Incoming Edge
Login via ORCiD to contribute.
Add Outgoing Edge
Login via ORCiD to contribute.