Flexible Graph Connectivity
From MaRDI portal
Publication:5041731
DOI10.1007/978-3-030-45771-6_2zbMath1503.90102OpenAlexW3100430808MaRDI QIDQ5041731
Felix Hommelsheim, Moritz Mühlenthaler, David Adjiashvili
Publication date: 14 October 2022
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-45771-6_2
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs
- A factor 2 approximation algorithm for the generalized Steiner network problem
- LP-relaxations for tree augmentation
- Flexible graph connectivity
- The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm
- On the Cycle Augmentation Problem: hardness and approximation algorithms
- Bulk-robust combinatorial optimization
- Iterated Rounding Algorithms for the Smallest k-Edge Connected Spanning Subgraph
- Approximating the smallest k -edge connected spanning subgraph by LP-rounding
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Approximation Algorithms for Several Graph Augmentation Problems
- Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs
- A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2
- Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree
- Time-Expanded Packings
- Improved approximation for tree augmentation: saving by rewiring
