Biconnectivity approximations and graph carvings
From MaRDI portal
Publication:4299007
Recommendations
- Algorithms and Computation
- scientific article; zbMATH DE number 3981211
- Connectivity of bi-Cayley graphs
- Connectivity of large bipartite digraphs and graphs
- scientific article; zbMATH DE number 1390507
- scientific article; zbMATH DE number 4061296
- Approximations of acyclic graphs
- Fully dynamic biconnectivity in graphs
- scientific article; zbMATH DE number 1256640
- Spectral bisection of graphs and connectedness
Cited in
(66)- Fast distributed approximation for TAP and 2-edge-connectivity
- Pruning 2-connected graphs
- Approximating unweighted connectivity problems in parallel
- Color-avoiding connected spanning subgraphs with minimum number of edges
- scientific article; zbMATH DE number 437534 (Why is no real title available?)
- Approximating bounded-degree spanning trees and connected factors with leaves
- Approximation algorithms for connected graph factors of minimum weight
- Power optimization for connectivity problems
- Approximation and Online Algorithms
- Vertex covering by paths on trees with its applications in machine translation
- On minimum power connectivity problems
- ON THE VERTEX-CONNECTIVITY PROBLEM FOR GRAPHS WITH SHARPENED TRIANGLE INEQUALITY
- Relay placement for fault tolerance in wireless networks in higher dimensions
- Approximation algorithms for vertex-connectivity augmentation on the cycle
- Strongly connected spanning subgraph for almost symmetric networks
- Relay placement for two-connectivity
- A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs
- A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem
- scientific article; zbMATH DE number 1954373 (Why is no real title available?)
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
- Fast exact algorithms for survivable network design with uniform requirements
- 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
- Pruning 2-connected graphs
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
- A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs
- Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions
- On k-connectivity problems with sharpened triangle inequality
- scientific article; zbMATH DE number 1688381 (Why is no real title available?)
- Dual-based approximation algorithms for cut-based network connectivity problems
- Modifying edges of a network to obtain short subgraphs
- A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges
- Two-connected spanning subgraphs with at most \(\frac{10}{7}{\mathrm{OPT}}\) edges
- An Improved Approximation Algorithm for the Matching Augmentation Problem
- On finding two-connected subgraphs in planar graphs
- Probabilistic properties of highly connected random geometric graphs
- Correlation clustering and two-edge-connected augmentation for planar graphs
- GMPLS label space minimization through hypergraph layouts
- Network flow spanners
- Algorithms for a network design problem with crossing supermodular demands
- Approximating minimum size \{1,2\}-connected networks
- On the \(L_{\infty}\)-norm of extreme points for crossing supermodular directed network LPs
- Computing Minimal Spanning Subgraphs in Linear Time
- Finding 2-edge connected spanning subgraphs.
- scientific article; zbMATH DE number 742959 (Why is no real title available?)
- Approximating the smallest 2-vertex connected spanning subgraph of a directed graph
- On Finding Minimal Two-Connected Subgraphs
- An Ear Decomposition Approach to Approximating the Smallest 3-Edge Connected Spanning Subgraph of a Multigraph
- Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs
- On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem
- Approximating the smallest 2-vertex-connected spanning subgraph via low-high orders
- On the maximum size of a minimal \(k\)-edge connected augmentation
- A simple LP-based approximation algorithm for the matching augmentation problem
- Designing hypergraph layouts to GMPLS routing strategies
- Survivable network design: the capacitated minimum spanning network problem
- Approximation algorithms for graph augmentation
- Approximating the Minimum Equivalent Digraph
- A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem
- The generalized minimum edge-biconnected network problem: efficient neighborhood structures for variable neighborhood search
- Improving on the 1. 5-approximation of a smallest 2-edge connected spanning subgraph
- A \((1.5+\varepsilon)\)-approximation algorithm for weighted connectivity augmentation
- A PTAS for three-edge-connected survivable network design in planar graphs
- Approximating a class of combinatorial problems with rational objective function
- Towards more precise parallel biconnectivity approximation
- Approximating Minimum Cost Connectivity Orientation and Augmentation
- An efficient approximation algorithm for the survivable network design problem
- Fast distributed approximation for TAP and 2-edge-connectivity
This page was built for publication: Biconnectivity approximations and graph carvings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4299007)
