We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 44094a0 commit 5a5e67dCopy full SHA for 5a5e67d
README.md
@@ -1 +1,9 @@
1
# Formalising Theory of Approximating the Travelling-Salesman Problem
2
+
3
+## TODO
4
+- [x] formalize and proof correct Double-Tree algorithm (`./DoubleTree.thy`)
5
+- [x] formalize and proof correct Christofides-Serdyukov algorithm (`./ChristofidesSerdyukov.thy`)
6
+- [ ] (?) connect Prim formalization (finish adaptor `./MSTPrimAdaptor.thy`)
7
+- [ ] (?) formalize and proof correct algroithm for Eulerian Tour (`./Eulerian.thy`)
8
+- [ ] (?) formalize Multi-graphs by encoding Multi-graphs in normal-simple graphs (`./MultiGraph.thy`)
9
+- [ ] proof MAXSNP-hardness of metric TSP
0 commit comments