From 64e50168f1a3fd54ff83fb02a3a82e1107799950 Mon Sep 17 00:00:00 2001
From: Mario Surlemont <mario.surlemont@uni-duesseldorf.de>
Date: Tue, 16 Jun 2020 22:40:52 +0200
Subject: [PATCH] Update todo.md
---
journal/todo.md | 7 +++++--
1 file changed, 5 insertions(+), 2 deletions(-)
diff --git a/journal/todo.md b/journal/todo.md
index 8a241a3..07b4650 100644
--- a/journal/todo.md
+++ b/journal/todo.md
@@ -60,8 +60,11 @@
- So at first I would not follow this idea and try to find another technique to generate a better lower bound.
## thesis
-* Begin paragraph about results and add preliminary results and observations.
- - Refinde the concept how to test and which test results you want to include.
+* Begin paragraph about results and add preliminary results and observations. ❌
+ - Refine the concept how to test and which test results you want to include. (✔)
+ - The concept was refined as additonal parameters were added which could underpin (or disprove) the assumption that our graphs and gridlike graphs in general are hard too solve with this approach.
+ - The paragraph as a latex file wasn't started yet. ❌
+ - This has the HIGHEST priority for week 6 as writing is (for me) the least pleasurefull task.
## literature
* Read _Imposing Connectivity Constraints in Forest Planning Models_. ✔
--
GitLab