The authors propose two algorithmic frameworks to design approximation algorithms for the Enclosing-All-Points problem, one based on sparsification and min-cut, and the other based on LP rounding.
