A method for solving least coverage problems as a grid planning tool

A method for solving least cover and least vertex cover problems in arbitrary graphs enabling the construction of effective algorithms for calculating minimum cluster numbers is proposed. This enables the solution of a given subset of tasks in GRID with desirable efficiency.