论文标题
Dota Underlords游戏是NP完整的
Dota Underlords game is NP-complete
论文作者
论文摘要
在本文中，我们演示了流行的计算机游戏DOTA底座中最佳团队选择的问题如何减少到线性整数编程的问题。我们提出了一个模型并将其解决用于真实数据。我们还证明了此问题属于NP complete类，并证明它减少到了最大边缘加权集团问题。
In this paper, we demonstrate how the problem of the optimal team choice in the popular computer game Dota Underlords can be reduced to the problem of linear integer programming. We propose a model and solve it for the real data. We also prove that this problem belongs to the NP-complete class and show that it reduces to the maximum edge weighted clique problem.
