Randomized Rounding over Dynamic Programs
Etienne Bamas, Shi Li, Lars Rohwedder

TL;DR
This paper introduces a method to incorporate approximate packing constraints into solutions derived from dynamic programming, using randomized rounding on LP relaxations, applicable to many classical problems and enabling new constraint-based problem modeling.
Contribution
It presents a novel approach that combines dynamic programming reinterpretation with LP relaxation and randomized rounding to handle additional constraints in a broad class of problems.
Findings
Achieves roughly $(n^{\\epsilon} \\mathrm{polylog}\ n)$-approximation in polynomial time.
Polylogarithmic approximation possible in quasi-polynomial time with specific parameter settings.
Applicable to classical problems like Shortest Path and Longest Common Subsequence, enabling constraint imposition.
Abstract
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, for example, polynomial in the problem size. Technically, we reinterpret the dynamic programming subproblems and their solutions as a network design problem. Inspired by techniques from, for example, 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 -approximation in time , for any . By setting , we obtain a polylogarithmic approximation in quasi-polynomial time,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Advanced Graph Theory Research · Optimization and Packing Problems
