14 citations · 74 across the 36 of their papers we have counts for
3 papers · 1 filter
Fast Algorithms for Knapsack via Convolution and Prediction
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Saeed Seddighin +1
The \Problem{knapsack} problem is a fundamental problem in combinatorial optimization. It has been studied extensively from theoretical as well as practical perspectives as it is o…
Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs
MohammadHossein Bateni, Alireza Farhadi, MohammadTaghi Hajiaghayi
The -cut problem asks, given a connected graph and a positive integer , to find a minimum-weight set of edges whose removal splits into connected components. We g…
Massively Parallel Dynamic Programming on Trees
MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan +2
Dynamic programming is a powerful technique that is, unfortunately, often inherently sequential. That is, there exists no unified method to parallelize algorithms that use dynamic…