Raport

[migoox]

1. Vision of What This Should Be

• Abstract: What problem are we trying to solve -- Marek
• Light biological background -- Marek

2. Theory

• Definition of the 2-MCP and 2-QMCP problems -- Michał
• What is NP-hard and what is not, what is an approximation and what is not, supported by sources -- Michał

3. What We Did (Implementation)

1. Solution using flow network
   • Theoretical description of the solution -- Michał
   • Proof that circulation always covers -- Michał
   • Possible proof that minimum circulation is the optimal solution -- Michał
   • Which algorithms were used -- Borys/Michał
2. Linear programming
   • Theoretical description of the solution (reduction to canonical form) -- Michał
   • Which algorithms and libraries were used -- Borys

4. Experiment Results

1. Flow network
   • Graphs showing coverage -- Marek
   • Comparison of max flow CUDA vs CPU (time) -- Marek
   • Comparison of min cost max flow with max flow (coverage) -- Marek
2. Linear programming
   • Memory usage cuSPARSE, limitations -- Borys
   • Coverage results (graphs) -- Borys
   • Use of interesting weights -- Borys

5. Conclusions and Future Remarks

• Conclusions and future remarks -- Borys/Marek/Michał