* Mix the stuff from the methods section and the definitions up a bit.
* 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!)
* 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 type of constraints to enforce connectivity. ✔
- Different constraints that I tried to strengthen the ILP formulation and preventively adding separator constraints.
- Different constraints that I tried to strengthen the ILP formulation and preventively adding separator constraints. ✔
- Introduction
- Introduction ❌
- Table of results
- Table of results ❌
- Discussion
- Discussion ❌
- Implementation
- Implementation ❌
## python
## python
### runtime
### 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.
* 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 250 graphs.✔
- GNM 100 graphs.
- GNM 100 graphs. ✔
* 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. ✔
## 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.