A tight analysis of the greedy algorithm for set cover
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Hi-index | 0.00 |
This paper proposed a method for station point optimization of the total station of automatic guidance system in shield tunneling, which is not analyzed widely at present. In this paper, station point optimization is converted into a set-covering problem. In order to express the measurability of the active target station for the total station, a 0-1 measurability matrix is introduced, and each element in the matrix represents a measurability judgment, which includes the visibility test, the distance test, and the incidence angle test. Then, the greedy algorithm is used to find the approximate optimal solution of this set-covering problem. Furthermore, an application example affirmed that our method was effective.