- I wrote those bullet points that I want to include in a text file. But I haven't created an tex file yet.
* Refactor the paragraph for Implementation and methods. (wednesday) ✔
# Week 7
## thesis
* According to Elines feedback.
- Move definitions from methods to a preliminary section and move the intro into ILP's to this section. ✔
- Move the stuff from the implementation section to the methods section and mix it up a bit. (✔)
- (The implementation section was removed for now and its content was moved to methods. Most of the definitions from the preliminaries section should be moved to method section and mixed up with the content)
- Rework the part with the vertex separators and be more precise and specific. ✔
- Add missing stuff. (❌)
- Different type of constraints to enforce connectivity. (✔)
- I wrote a german draft to get an idea how to do it.
- Different constraints that I tried to strengthen the ILP formulation and preventively adding separator constraints. ❌
## python
### runtime
* Check how large is the difference between the size of a minimum dominanting set and a rooted connected minimum dominating set for all test instances.
- Done for leafs. ✔
# Week 8
## thesis
* Mix the stuff from the methods section and the definitions up a bit.
* Add missing stuff. (Highest priority! Rather have awfull stuff that can be refinded than having the feeling of getting stucked!)
- Different type of constraints to enforce connectivity.
- Different constraints that I tried to strengthen the ILP formulation and preventively adding separator constraints.
- Introduction
- Table of results
- Discussion
- Implementation
## python
### runtime
* Check how large is the difference between the size of a minimum dominanting set and a rooted connected minimum dominating set for all test instances.
- GNM 250 graphs.
- GNM 100 graphs.
## python
### runtime
* For the leaf instances, the grid graphs and some of the random graphs:
- measure the size of a minimal unconnected solution and how fast the added separators close the gap.
