scientific article
From MaRDI portal
Publication:3579405
zbMATH Open1192.68030MaRDI QIDQ3579405FDOQ3579405
Danny Segev, Anupam Gupta, Guy Even, Chandra Chekuri
Publication date: 6 August 2010
Title of this publication is not available (Why is that?)
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Deterministic network models in operations research (90B10) Approximation algorithms (68W25) Connectivity (05C40)
Cited In (7)
- How to Secure Matchings Against Edge Failures
- Improved approximation algorithms for directed Steiner forest
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing
- Pruning 2-connected graphs
- The Set Connector Problem in Graphs
- Directed Steiner problems with connectivity constraints
- Approximating \(k\)-generalized connectivity via collapsing HSTs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579405)
