We provide a computationally efficient black-box reduction from mechanism
design to algorithm design in very general settings. Specifically, we give an
approximation-preserving reduction from truthfully maximizing \emph{any}
objective under \emph{arbitrary} feasibility constraints with