scientific article; zbMATH DE number 6850362
From MaRDI portal
Publication:4607935
zbMATH Open1403.68347arXiv1702.05567MaRDI QIDQ4607935FDOQ4607935
Authors: 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 of this publication is not available (Why is that?)
Recommendations
- Beating approximation factor two for weighted tree augmentation with bounded costs
- Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs
- Approximating Generalized Multicut on Trees
- On weighted multiway cuts in trees
- Tight bounds for online weighted tree augmentation
- Tight bounds for online weighted tree augmentation
- Improved approximation for tree augmentation: saving by rewiring
- Approximating (unweighted) tree augmentation via lift-and-project. II
- Parameterized complexity of weighted multicut in trees
- Parameterized complexity of multicut in weighted trees
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Cited In (31)
- How to Secure Matchings Against Edge Failures
- Fast distributed approximation for TAP and 2-edge-connectivity
- Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem
- Tight bounds for online weighted tree augmentation
- Tight bounds for online weighted tree augmentation
- On the tree augmentation problem
- Approximation algorithms for vertex-connectivity augmentation on the cycle
- Flexible graph connectivity
- The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm
- 2-node-connectivity network design
- Chvátal-Gomory cuts for the Steiner tree problem
- Node connectivity augmentation via iterative randomized rounding
- An Improved Approximation Algorithm for the Matching Augmentation Problem
- Better-than-\(\frac{4}{3}\)-approximations for leaf-to-leaf tree and connectivity augmentation
- Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs
- Approximation algorithms for connectivity augmentation problems
- Approximation algorithms for node and element connectivity augmentation problems
- A simple LP-based approximation algorithm for the matching augmentation problem
- Flexible Graph Connectivity
- Strengthening convex relaxations of 0/1-sets using Boolean formulas
- A \((1.5+\varepsilon)\)-approximation algorithm for weighted connectivity augmentation
- LP-relaxations for tree augmentation
- LP-relaxations for tree augmentation
- Approximating (unweighted) tree augmentation via lift-and-project. II
- 2-node-connectivity network design
- Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree
- Improved approximation for tree augmentation: saving by rewiring
- On the cycle augmentation problem: hardness and approximation algorithms
- On small-depth tree augmentations
- Beating approximation factor two for weighted tree augmentation with bounded costs
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 Q4607935)
