14 citations · 74 across the 36 of their papers we have counts for
Showing 2009 · cs.DSShow all
2 papers · 2 filters
cs.DS2009
Euclidean Prize-collecting Steiner Forest
MohammadHossein Bateni, MohammadTaghi Hajiaghayi
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Eucl…
cs.DS2009★ 3 cited
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, we s…