21 citations · 89 across the 29 of their papers we have counts for
38 papers
The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller than 2
Jarosław Byrka, Fabrizio Grandoni, Vera Traub
The Steiner tree problem is one of the most prominent problems in network design. Given an edge-weighted undirected graph and a subset of the vertices, called terminals, the task i…
A Approximation for -Vertex-Connectivity
Miguel Bosch-Calvo, Fabrizio Grandoni, Afrouz Jabal Ameli
The 2-Vertex-Connected Spanning Subgraph problem (2VCSS) is among the most basic NP-hard (Survivable) Network Design problems: we are given an (unweighted) undirected graph . Ou…
An O(loglog n)-Approximation for Submodular Facility Location
Fateme Abbasi, Marek Adamczyk, Miguel Bosch-Calvo +4
In the Submodular Facility Location problem (SFL) we are given a collection of clients and facilities in a metric space. A feasible solution consists of an assignment of ea…
Unsplittable Euclidean Capacitated Vehicle Routing: A -Approximation Algorithm
Fabrizio Grandoni, Claire Mathieu, Hang Zhou
In the unsplittable capacitated vehicle routing problem, we are given a metric space with a vertex called depot and a set of vertices called terminals. Each terminal is associated…
Improved Approximation for Two-Edge-Connectivity
Mohit Garg, Fabrizio Grandoni, Afrouz Jabal Ameli
The basic goal of survivable network design is to construct low-cost networks which preserve a sufficient level of connectivity despite the failure or removal of a few nodes or edg…
Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median
Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee +1
The Uncapacitated Facility Location (UFL) problem is one of the most fundamental clustering problems: Given a set of clients and a set of facilities in a metric space $(C \…