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