6 citations · 10 across the 3 of their papers we have counts for
3 papers
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…
cs.DS2010★ 1 cited
Prizing on Paths: A PTAS for the Highway Problem
Fabrizio Grandoni, Thomas Rothvoss
In the highway problem, we are given an n-edge line graph (the highway), and a set of paths (the drivers), each one with its own budget. For a given assignment of edge weights (the…
cs.DS2010★ 6 cited
Optimization with More than One Budget
Fabrizio Grandoni, Rico Zenklusen
A natural way to deal with multiple, partially conflicting objectives is turning all the objectives but one into budget constraints. Some classical polynomial-time optimization pro…