Seminar on Internet Technologies (Summer 2020): Difference between revisions
Jump to navigation
Jump to search
(→Topics) |
(→Topics) |
||
| Line 81: | Line 81: | ||
| [Weijun Wang, weijun.wang@cs.uni-goettingen.de] | | [Weijun Wang, weijun.wang@cs.uni-goettingen.de] | ||
| [https://www.microsoft.com/en-us/research/wp-content/uploads/2017/08/Bahl-MobiCom-2015.pdf] | | [https://www.microsoft.com/en-us/research/wp-content/uploads/2017/08/Bahl-MobiCom-2015.pdf] | ||
|- | |||
| Learning Combinatorial Optimization Algorithms over Graphs | |||
| There are many NP-hard problems about graph. However, these NP-hard problems cannot be solved fast by optimization solver. Approximation algorithms could solve them fast in the cost of sacrificing the accuracy. Recently, some algorithms based on machine learning have been proposed to solve these NP-hard problems in the manner of end-to-end. After reproducing one classical paper, the student is required to find solution for a new Vihecl Routing Problem. | |||
| The student should be familiar with TSP, Matching, and Integer linear programming | |||
| [Weijun Wangn, weijun.wang@cs.uni-goettingen.de] | |||
| | |||
|- | |- | ||
|} | |} | ||