Solution of continuous problems of optimal covering with spheres using optimal set-partition theory
2009
The paper considers a continuous problem of optimal c-sphere covering of a compact set from ? from E n with a given number of spheres of minimum radius and a problem of covering a set with the minimum number of spheres of given radius. Algorithms are proposed and substantiated to solve the problems using optimal set-partition theory and Shor's r-algorithm.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
7
References
7
Citations
NaN
KQI