diff options
| author | Dan Schult <dschult@colgate.edu> | 2021-04-26 01:53:03 -0400 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2021-04-26 07:53:03 +0200 |
| commit | d70b314b37168f0ea7c5b0d7f9ff61d73232747b (patch) | |
| tree | 2764466339c9d9d23ec6e42cc074ecb4b0177880 | |
| parent | 4a8210c14643b001cf1f97d32892c2c4134bc5a0 (diff) | |
| download | networkx-d70b314b37168f0ea7c5b0d7f9ff61d73232747b.tar.gz | |
Add 2 articles for TSP project as references (#4758)
| -rw-r--r-- | doc/developer/projects.rst | 6 |
1 files changed, 6 insertions, 0 deletions
diff --git a/doc/developer/projects.rst b/doc/developer/projects.rst index 1b5db27d..14bedef5 100644 --- a/doc/developer/projects.rst +++ b/doc/developer/projects.rst @@ -75,6 +75,10 @@ Directed Version of Traveling Salesman Problem for directed graphs is by `Asapour`_ et.al. and has not yet been implemented. The goal of this project is to learn the API used for implemented methods and then implement the Asadpour method for directed graphs with similar API. + Other even more recent papers discussing algorithm improvements for directed + TSP (also called Asymmetric TSP or ATSP) include `Svensson`__ and `Traub`__. + The Traub paper may be most useful for implementing the algorithm as all three + are focused on proving asymptotic computation requirements rather than coding. - Recommended Skills: Python, graph algorithms @@ -87,6 +91,8 @@ Directed Version of Traveling Salesman Problem .. _#4607: https://github.com/networkx/networkx/pull/4607 .. _Asapour: https://pubsonline.informs.org/doi/pdf/10.1287/opre.2017.1603 +.. _Svensson: https://doi.org/10.1109/FOCS.2015.10 (https://arxiv.org/abs/1502.02051) +.. _Traub: https://doi.org/10.1145/3357713.3384233 (https://arxiv.org/abs/1912.00670) Implement the VF2++ Graph Isomorphism Algorithm |