2 citations · 2 across the 7 of their papers we have counts for
3 papers · 1 filter
On the Bidirected Cut Relaxation for Steiner Forest
Jarosław Byrka, Fabrizio Grandoni, Vera Traub
The Steiner Forest problem is an important generalization of the Steiner Tree problem. We are given an undirected graph with nonnegative edge costs and a collection of pairs of ver…
A -Approximation for Two-Edge Connectivity
Miguel Bosch-Calvo, Mohit Garg, Fabrizio Grandoni +3
The 2-Edge-Connected Spanning Subgraph problem (2ECSS) is among the most basic survivable network design problems: given an undirected and unweighted graph, the task is to find a s…
Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions
Fabrizio Grandoni, Edin Husić, Mathieu Mari +1
In the maximum independent set of convex polygons problem, we are given a set of convex polygons in the plane with the objective of selecting a maximum cardinality subset of no…