Antonis Antonopoulos

activity

20192025

k

-Subset Sum and Variations

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

cs.DS2022

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 $1$ as possi…

cs.DS2022★ 1 cited

Faster Algorithms for $k$ -Subset Sum and Variations

Antonis Antonopoulos, Aris Pagourtzis, Stavros Petsalakis +1

We present new, faster pseudopolynomial time algorithms for the $k$ -Subset Sum problem, defined as follows: given a set $Z$ of $n$ positive integers and $k$ targets $t_1, \ldots, t…

Approximating Subset Sum Ratio via Partition Computations

Faster Algorithms for k-Subset Sum and Variations

Faster Algorithms for $k$ -Subset Sum and Variations