Flexible graph connectivity
From MaRDI portal
Publication:2118137
Recommendations
- Flexible Graph Connectivity
- Connection graphs
- scientific article; zbMATH DE number 1539529
- Connectivity parameters of graphs
- Graphs with given connectivity properties
- scientific article; zbMATH DE number 2172752
- Connectivity of path graphs
- scientific article; zbMATH DE number 1744097
- Connected Soft Graph
- Connected graphs and their connectivities
Cites work
- A factor 2 approximation algorithm for the generalized Steiner network problem
- A simplified 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
- An Improved Analysis for Approximating the Smallest k-Edge Connected Spanning Subgraph of a Multigraph
- Approximability of capacitated network design
- Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching
- Approximation Algorithms for Several Graph Augmentation Problems
- Beating approximation factor two for weighted tree augmentation with bounded costs
- Bulk-robust combinatorial optimization
- Capacitated network design on undirected graphs
- Flexible Graph Connectivity
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- scientific article; zbMATH DE number 1003253 (Why is no real title available?)
- scientific article; zbMATH DE number 6850362 (Why is no real title available?)
- scientific article; zbMATH DE number 7205039 (Why is no real title available?)
- Improved approximation for tree augmentation: saving by rewiring
- Iterated rounding algorithms for the smallest k-edge connected spanning subgraph
- LP-relaxations for tree augmentation
- 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
- The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm
- Time-expanded packings
Cited in
(11)- Flexible Graph Connectivity
- Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions
- A global analysis of the primal-dual method for edge augmentation problems
- On the complexity of finding a sparse connected spanning subgraph in a non-uniform failure model
- Improved approximation algorithms for covering pliable set families and flexible graph connectivity
- Improved approximations for flexible network design
- When does FTP become FPT??
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Improved approximation algorithms for capacitated network design and flexible graph connectivity
This page was built for publication: Flexible graph connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118137)
