In recent years, it has become abundantly clear that there is a
fundamental connection between certain purely combinatorial
problems on the one hand, and high-dimensional geometric
phenomena on the other. This relationship arises when we allow
ourselves to consider "approximate" solutions to various
(hard) optimization problems. I'll give some interesting examples of this,
along with some interesting math, and little a posteriori
philosophical justification of why this makes sense.