Publication:3579405
From MaRDI portal
zbMath1192.68030MaRDI QIDQ3579405
Danny Segev, Anupam Gupta, Guy Even, Chandra Chekuri
Publication date: 6 August 2010
68W40: Analysis of algorithms
68R10: Graph theory (including graph drawing) in computer science
90B10: Deterministic network models in operations research
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
05C40: Connectivity
Related Items
How to Secure Matchings Against Edge Failures, Improved approximation algorithms for directed Steiner forest, Approximating \(k\)-generalized connectivity via collapsing HSTs, Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing, Pruning 2-connected graphs