6 citations · 8 across the 5 of their papers we have counts for
3 papers · 1 filter
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…
Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Vahid Liaghat
Moss and Rabani[12] study constrained node-weighted Steiner tree problems with two independent weight values associated with each node, namely, cost and prize (or penalty). They gi…