10 citations · 11 across the 10 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
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…
cs.CC2019
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…