Commit c040098f by Mario Surlemont

### Update todo.md

parent 0be54329
 ... ... @@ -38,9 +38,11 @@ - To what degree does the number of unconnected k-hop solutions which have at most as many nodes as an optimal connected solution affect the runtime? (Calculate how many of them exist and add this data as a column to a table of test results) - Is there a clear corellation between the number of constraints which were added and the runtime for (possible unconnected) solutions? - Check for graphs where the gap between an optimal connected solution and the smallest unconnected solution is rather big if this approach(our implementation) might be unapplyable. Such that there is too much time wasted to exclude all possible unconnected solutions and increase the lower bound. * Implement a heuristic to start with a stronger lower bound. * Implement a heuristic to start with a stronger lower bound. ✔ - Given a symmetrical leaf where the root is centered (at least on the x-axis). There are at least ![width-2*k+height-k-\frac{width}{2}-k](https://render.githubusercontent.com/render/math?math=width-2*k%2Bheight-k-%5Cfrac%7Bwidth%7D%7B2%7D-k) nodes needed to provide a connected dominating set. - To reach both rims in the width and the rim on the top. - Unfortunately this did not improve the runtime at least for the bigger-leaf example with k=2. It drastically increased the runtime. - 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. ... ... @@ -60,7 +62,7 @@ # Backlog ## Python ### Implementation * Remove lp_to_graph from package and instead use some other format to store graphs and use them as input. * Remove lp_to_graph from package and instead use some other format to store graphs and use them as input. ✔ * Implement different type of constraints. - _Solving the Maximum-Weight Connected Subgraph Problem to Optimality_ ... ...
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!