21 citations · 89 across the 29 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DS2012★ 1 cited
A Mazing 2+eps Approximation for Unsplittable Flow on a Path
Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi +1
We study the unsplittable flow on a path problem (UFP) where we are given a path with non-negative edge capacities and tasks, which are characterized by a subpath, a demand, and a…
cs.DS2012★ 3 cited
On Min-Power Steiner Tree
Fabrizio Grandoni
In the classical (min-cost) Steiner tree problem, we are given an edge-weighted undirected graph and a set of terminal nodes. The goal is to compute a min-cost tree S which spans a…