From 602e9b0aadd36ca27ada4aa8d195d5041e283f90 Mon Sep 17 00:00:00 2001
From: Mario Surlemont <mario.surlemont@uni-duesseldorf.de>
Date: Wed, 3 Jun 2020 12:23:45 +0200
Subject: [PATCH] Update progress.md
---
journal/progress.md | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/journal/progress.md b/journal/progress.md
index 5ad48cf..8dc3e45 100644
--- a/journal/progress.md
+++ b/journal/progress.md
@@ -44,7 +44,7 @@
* I wrote a paragraph which introduces ILP
## literature
-* I wrote following paper where I had taken the indegree inqualities from: _On imposing connectivity constraints in integer programs_
+* I read following paper where I had taken the indegree inqualities from: _On imposing connectivity constraints in integer programs_
- This paper references several other papers which deal with the topic. So I've also read the following _An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets_. But they also used the vertex-separator constraints and a lazy approach.
- Their results quite good. So I guess it also makes sense to make some research how the graphs they used "looked like" and what characteristics they had that our graphs not have.
--
GitLab