Approximation Schemes for Subset Sum Ratio Problems

Abstract

We consider the Subset Sum Ratio Problem (SSR), in which given a set of integers the goal is to find two subsets such that the ratio of their sums is as close to 1 as possible, and introduce a family of variations that capture additional meaningful requirements. Our main contribution is a generic framework that yields fully polynomial time approximation schemes (FPTAS) for problems in this family that meet certain conditions. We use our framework to design explicit FPTASs for two such problems, namely Two-Set Subset-Sum Ratio and Factor-r Subset-Sum Ratio, with running time O(n 4 /ε), which coincides with the best known running time for the original SSR problem [15].