1 citations · 1 across the 3 of their papers we have counts for
4 papers
Approximation Schemes for k-Subset Sum Ratio and k-way Number Partitioning Ratio
Sotiris Kanellopoulos, Giorgos Mitropoulos, Antonis Antonopoulos +5
The Subset Sum Ratio problem (SSR) asks, given a multiset of positive integers, to find two disjoint subsets of such that the largest-to-smallest ratio of their sums is min…
Approximating Subset Sum Ratio via Partition Computations
Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos +3
We present a new FPTAS for the Subset Sum Ratio problem, which, given a set of integers, asks for two disjoint subsets such that the ratio of their sums is as close to as possi…
Faster Algorithms for -Subset Sum and Variations
Antonis Antonopoulos, Aris Pagourtzis, Stavros Petsalakis +1
We present new, faster pseudopolynomial time algorithms for the -Subset Sum problem, defined as follows: given a set of positive integers and targets $t_1, \ldots, t…
Parameterized Fine-Grained Reductions
Elli Anastasiadi, Antonis Antonopoulos, Aris Pagourtzis +1
During recent years the field of fine-grained complexity has bloomed to produce a plethora of results, with both applied and theoretical impact on the computer science community. T…