Jaewoo Park

collaborators

2 papers

cs.DS2026

Faster Deterministic Approximation for Counting Knapsack

Ce Jin, Jaewoo Park, Barna Saha

Given $n$ nonnegative integer weights $w_{1}, \dots, w_{n}$ and an integer knapsack capacity $T$ , the $#$ Knapsack problem asks to count the number of subsets $I \subseteq \{1, 2, \do…

cs.DS2026

Deterministic Monotone Min-Plus Product and Convolution

Ce Jin, Jaewoo Park, Barna Saha +1

The Monotone Min-Plus Product problem is a useful primitive that has seen many algorithmic applications over the past decade. In this problem, we are given two $n \times n$ integer…