Approximation Schemes for Subset Sum Ratio Problems

14 Mar 2020 Melissinos Nikolaos Pagourtzis Aris Triommatis Theofilos

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... (read more)

PDF Abstract
No code implementations yet. Submit your code now