For sink-free orientations in graphs of minimum degree at least 3, we present a marginal sampling algorithm for the status of a single vertex. With this algorithm, we present polynomial-time algorithms to deterministically approximate and randomly approximate the corresponding partition function. We also remark on connections to the independence polynomial.