
Approximation Schemes for Subset Sum Ratio Problems
We consider the Subset Sum Ratio Problem (SSR), in which given a set of ...
read it

Characterizations and approximability of hard counting classes below #P
An important objective of research in counting complexity is to understa...
read it

Approximate #Knapsack Computations to Count SemiFair Allocations
In this paper, we study the problem of counting the number of different ...
read it

Parameterized FineGrained Reductions
During recent years the field of finegrained complexity has bloomed to ...
read it

A Faster FPTAS for the SubsetSums Ratio Problem
The SubsetSums Ratio problem (SSR) is an optimization problem in which,...
read it

Joining Local Knowledge to Communicate Reliably (Extended Abstract)
A fundamental primitive in distributed computing is Reliable Message Tra...
read it
Aris Pagourtzis
is this you? claim profile