Randomized Rounding over Dynamic Programs

We show that under mild assumptions for a problem whose solutions admit a dynamic programming-like recurrence relation, we can still find a solution under additional packing constraints, which need to be satisfied approximately. The number of additional constraints can be very large, e.g., polynomial in the problem size. Technically, we reinterpret the dynamic programming subproblems and their solutions as a network design problem. Inspired by techniques from, e.g., the Directed Steiner Tree problem, we construct a strong LP relaxation, on which we then apply randomized rounding. Our approximation guarantees on the packing constraints have roughly the form of a (nϵ polylog n)-approximation in time nO(1/ϵ), for any ϵ > 0. By setting ϵ=loglogn/logn, we obtain a polylogarithmic approximation in quasi-polynomial time, or by setting ϵ as a constant, an nϵ-approximation in polynomial time. While there are necessary assumptions on the form of the DP, it is general enough to capture many textbook dynamic programs from Shortest Path to Longest Common Subsequence. Our algorithm then implies that we can impose additional constraints on the solutions to these problems. This allows us to model various problems from the literature in approximation algorithms, many of which were not thought to be connected to dynamic programming. In fact, our result can even be applied indirectly to some problems that involve covering instead of packing constraints, for example, the Directed Steiner Tree problem, or those that do not directly follow a recurrence relation, for example, variants of the Matching problem. Specifically, we recover state-of-the-art approximation algorithms for Directed Steiner Tree and Santa Claus, and generalizations of them. We obtain new results for a variety of challenging optimization problems, such as Robust Shortest Path, Robust Bipartite Matching, Colorful Orienteering, Integer Generalized Flows, and more.