  We present a constant-factor approximation algorithm for the Nash social
welfare maximization problem with subadditive valuations accessible via demand
queries. More generally, we propose a template for NSW optimization by solving
a configuration-type LP and using a rounding procedure for (utilitarian) social
welfare as a blackbox, which could be applicable to other variants of the
problem.
