Set connectivity problems in undirected graphs and the directed steiner network problem
From MaRDI portal
Publication:3189000
DOI10.1145/1921659.1921664zbMath1295.68211OpenAlexW2620939520MaRDI QIDQ3189000
Danny Segev, Guy Even, Chandra Chekuri, Anupam Gupta
Publication date: 9 September 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1921659.1921664
Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Connectivity (05C40)
Related Items (16)
On minimum generalized Manhattan connections ⋮ Online Buy-at-Bulk Network Design ⋮ Approximation algorithms for orienting mixed graphs ⋮ Reachability Preservers: New Extremal Bounds and Approximation Algorithms ⋮ An ETH-tight algorithm for bidirected Steiner connectivity ⋮ Bayesian generalized network design ⋮ The subdivision-constrained routing requests problem ⋮ ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network ⋮ How to Secure Matchings against Edge Failures ⋮ Approximation algorithms for constructing some required structures in digraphs ⋮ Approximation algorithm for the partial set multi-cover problem ⋮ Unnamed Item ⋮ Spider Covering Algorithms for Network Design Problems ⋮ Balls and Funnels: Energy Efficient Group-to-Group Anycasts ⋮ Complexity of the Steiner Network Problem with Respect to the Number of Terminals ⋮ Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
This page was built for publication: Set connectivity problems in undirected graphs and the directed steiner network problem
