1 citations · 1 across the 3 of their papers we have counts for
3 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…
Single-Source Unsplittable Flows in Planar Graphs
Vera Traub, Laura Vargas Koch, Rico Zenklusen
The single-source unsplittable flow (SSUF) problem asks to send flow from a common source to different terminals with unrelated demands, each terminal being served through a single…
Breaching the 2-Approximation Barrier for the Forest Augmentation Problem
Fabrizio Grandoni, Afrouz Jabal Ameli, Vera Traub
The basic goal of survivable network design is to build cheap networks that guarantee the connectivity of certain pairs of nodes despite the failure of a few edges or nodes. A cele…