research
∙
08/15/2023
A Nearly Quadratic-Time FPTAS for Knapsack
We investigate polynomial-time approximation schemes for the classic 0-1...
share
research
∙
07/24/2023
Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results
We investigate pseudopolynomial-time algorithms for Bounded Knapsack and...
research
∙
05/15/2019
Restricted Max-Min Allocation: Approximation and Integrality Gap
Asadpour, Feige, and Saberi proved that the integrality gap of the confi...
research
∙
07/11/2018
Integrality Gap of the Configuration LP for the Restricted Max-Min Fair Allocation
The max-min fair allocation problem seeks an allocation of resources to ...
research
∙
04/29/2018