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
∙
12/02/2022
Fair Graphical Resource Allocation with Matching-Induced Utilities
Motivated by real-world applications, we study the fair allocation of gr...
research
∙
04/23/2022
Approximation Algorithms for Interdiction Problem with Packing Constraints
We study a bilevel optimization problem which is a zero-sum Stackelberg ...
research
∙
04/20/2022
A Best Cost-Sharing Rule for Selfish Bin Packing
In selfish bin packing, each item is regarded as a player, who aims to m...
research
∙
07/30/2020
Approximate Ridesharing of Personal Vehicles Problem
The ridesharing problem is that given a set of trips, each trip consists...
research
∙
02/27/2019