Approximation Schemes for Subset Sum Ratio Problems

03/14/2020
by   Nikolaos Melissinos, et al.
0

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].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/06/2022

Improved Approximation Schemes for (Un-)Bounded Subset-Sum and Partition

We consider the SUBSET SUM problem and its important variants in this pa...
research
01/11/2022

Approximating Subset Sum Ratio via Subset Sum Computations

We present a new FPTAS for the Subset Sum Ratio problem, which, given a ...
research
03/27/2018

A Faster FPTAS for the Subset-Sums Ratio Problem

The Subset-Sums Ratio problem (SSR) is an optimization problem in which,...
research
12/08/2021

Faster Algorithms for k-Subset Sum and Variations

We present new, faster pseudopolynomial time algorithms for the k-Subset...
research
04/06/2018

Subquadratic Approximation Scheme for Partition

The subject of this paper is the time complexity of approximating Knapsa...
research
09/26/2013

Treedy: A Heuristic for Counting and Sampling Subsets

Consider a collection of weighted subsets of a ground set N. Given a que...
research
02/06/2021

Approximating Happiness Maximizing Set Problems

A Happiness Maximizing Set (HMS) is a useful concept in which a smaller ...

Please sign up or login with your details

Forgot password? Click here to reset