1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2023
On the Approximability of External-Influence-Driven Problems
Panagiotis Aivasiliotis, Aris Pagourtzis
Domination problems in general can capture situations in which some entities have an effect on other entities (and sometimes on themselves). The usual goal is to select a minimum n…
cs.DS2022★ 1 cited
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…