commit 28da73c868ad7444dba7a754fb77a41f6ca7cb07
author Alexander Afanasyev <aa@cs.fiu.edu> Mon Jun 01 22:51:37 2020 -0400
committer Alexander Afanasyev <aa@cs.fiu.edu> Mon Jun 01 22:51:37 2020 -0400
tree 9b40af79964cff0fffba81b24245fca2a2113dde
parent 49ecab2fdf5523f87b55571286b528ff33e69df7

Release documentation fixes

Change-Id: Ia5f81e627d7faea39b1f24d56de7cac9aaf71b27

docs/source/examples.rst

diff --git a/docs/source/examples.rst b/docs/source/examples.rst
index 84a25bb..e61135d 100644
--- a/docs/source/examples.rst
+++ b/docs/source/examples.rst
@@ -514,7 +514,7 @@
 ----------------------------------------------------
 
 LFID (Loop-Free Inport-Dependent) Routing extends the ndnSIM route calculation to provide loop-free and on average shorter loop-free paths than existing work.
-For details see the `tech report.`_
+For details see the `tech report. <https://named-data.net/publications/techreports/mp_routing_tech_report/>`__
 
 LFID provides a better trade-off than the existing route calculation algorithms: