Analysis and Discussion of Radar Construction Problems with Greedy Algorithm

摘要

Greedy Algorithm always makes the best choice at moment. In other words, without considering the overall optimality, what it has done is a partial optimal in a situation. The Greedy Algorithm is not the best solution for all problems. For the issues involved in this paper, the advantage of greedy algorithm is more correct and the choice of greedy strategy is only relevant to the current state.