We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 2bda8b6 commit 68bab73Copy full SHA for 68bab73
README.md
@@ -1,7 +1,7 @@
1
-# An Efficient Graph Convolutional Network for the Travelling Salesman Problem
+# An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem
2
3
This repository contains code for the paper
4
-[**"An Efficient Graph Convolutional Network for the Travelling Salesman Problem"**](https://arxiv.org/abs/1906.01227)
+[**"An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem"**](https://arxiv.org/abs/1906.01227)
5
by Chaitanya K. Joshi, Thomas Laurent and Xavier Bresson.
6
7
We introduce a new learning-based approach for approximately solving the
0 commit comments