research
∙
08/14/2023
(1-ε)-Approximation of Knapsack in Nearly Quadratic Time
Knapsack is one of the most fundamental problems in theoretical computer...
share
research
∙
06/05/2023
Fully-Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time
The All-Pairs Shortest Paths (APSP) problem is one of the fundamental pr...
research
∙
01/23/2023
Approximating Knapsack and Partition via Dense Subset Sums
Knapsack and Partition are two important additive problems whose fine-gr...
research
∙
08/04/2022
DL-DRL: A double-layer deep reinforcement learning approach for large-scale task scheduling of multi-UAV
This paper studies deep reinforcement learning (DRL) for the task schedu...
research
∙
02/27/2022
On Problems Related to Unbounded SubsetSum: A Unified Combinatorial Approach
Unbounded SubsetSum is a classical textbook problem: given integers w_1,...
research
∙
06/03/2021
Breaking the Cubic Barrier for (Unweighted) Tree Edit Distance
The (unweighted) tree edit distance problem for n node trees asks to com...
research
∙
01/10/2021
Shortest non-separating st-path on chordal graphs
Many NP-Hard problems on general graphs, such as maximum independence se...
research
∙
12/02/2020
