2 papers
cs.DS2020
Approximation Schemes for Subset Sum Ratio Problems
Nikolaos Melissinos, Aris Pagourtzis, Theofilos Triommatis
We consider the Subset Sum Ratio Problem (), 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, a…
cs.CC2019
Approximate #Knapsack Computations to Count Semi-Fair Allocations
Theofilos Triommatis, Aris Pagourtzis
In this paper, we study the problem of counting the number of different knapsack solutions with a prescribed cardinality. We present an FPTAS for this problem, based on dynamic pro…