scientific article; zbMATH DE number 6850362

zbMath1403.68347arXiv1702.05567MaRDI QIDQ4607935

Samuel Fiorini, Martin Groß, Jochen Könemann, Laura Sanità

Publication date: 15 March 2018

Full work available at URL: https://arxiv.org/abs/1702.05567

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (20)

An Improved Approximation Algorithm for the Matching Augmentation Problem ⋮ Flexible Graph Connectivity ⋮ A simple LP-based approximation algorithm for the matching augmentation problem ⋮ Chvátal-Gomory cuts for the Steiner tree problem ⋮ On the tree augmentation problem ⋮ Node connectivity augmentation via iterative randomized rounding ⋮ The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm ⋮ Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree ⋮ LP-relaxations for tree augmentation ⋮ On the cycle augmentation problem: hardness and approximation algorithms ⋮ Strengthening convex relaxations of 0/1-sets using Boolean formulas ⋮ Fast distributed approximation for TAP and 2-edge-connectivity ⋮ 2-node-connectivity network design ⋮ How to Secure Matchings Against Edge Failures ⋮ Approximation algorithms for vertex-connectivity augmentation on the cycle ⋮ On small-depth tree augmentations ⋮ Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem ⋮ Approximation algorithms for connectivity augmentation problems ⋮ 2-node-connectivity network design ⋮ Flexible graph connectivity

This page was built for publication: