Pages that link to "Item:Q4299007"
From MaRDI portal
The following pages link to Biconnectivity approximations and graph carvings (Q4299007):
Displayed 48 items.
- A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs (Q284336) (← links)
- A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges (Q298954) (← links)
- GMPLS label space minimization through hypergraph layouts (Q442249) (← links)
- 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 (Q484552) (← links)
- Relay placement for fault tolerance in wireless networks in higher dimensions (Q632722) (← links)
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality (Q703542) (← links)
- Dual-based approximation algorithms for cut-based network connectivity problems (Q722530) (← links)
- On the maximum size of a minimal \(k\)-edge connected augmentation (Q765200) (← links)
- Power optimization for connectivity problems (Q877193) (← links)
- On the \(L_{\infty}\)-norm of extreme points for crossing supermodular directed network LPs (Q877196) (← links)
- On minimum power connectivity problems (Q972357) (← links)
- On \(k\)-connectivity problems with sharpened triangle inequality (Q1002105) (← links)
- Vertex covering by paths on trees with its applications in machine translation (Q1045903) (← links)
- Modifying edges of a network to obtain short subgraphs (Q1274323) (← links)
- An efficient approximation algorithm for the survivable network design problem (Q1290632) (← links)
- On finding two-connected subgraphs in planar graphs (Q1376267) (← links)
- Finding 2-edge connected spanning subgraphs. (Q1426722) (← links)
- Approximating bounded-degree spanning trees and connected factors with leaves (Q1728165) (← links)
- Approximation algorithms for connected graph factors of minimum weight (Q1743127) (← links)
- On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem (Q1789587) (← links)
- Approximating unweighted connectivity problems in parallel (Q1854474) (← links)
- Approximating minimum size \{1,2\}-connected networks (Q1861563) (← links)
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree (Q1861569) (← links)
- Fast distributed approximation for TAP and 2-edge-connectivity (Q1988524) (← links)
- A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs (Q2019478) (← links)
- Approximation algorithms for vertex-connectivity augmentation on the cycle (Q2085731) (← links)
- A simple LP-based approximation algorithm for the matching augmentation problem (Q2164677) (← links)
- Relay placement for two-connectivity (Q2339829) (← links)
- Survivable network design: the capacitated minimum spanning network problem (Q2390307) (← links)
- Approximating a class of combinatorial problems with rational objective function (Q2638374) (← links)
- A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem (Q2680988) (← links)
- The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search (Q3057152) (← links)
- Network flow spanners (Q3057178) (← links)
- Strongly Connected Spanning Subgraph for Almost Symmetric Networks (Q3132920) (← links)
- Fast Distributed Approximation for TAP and 2-Edge-Connectivity (Q3300822) (← links)
- Designing Hypergraph Layouts to GMPLS Routing Strategies (Q3408160) (← links)
- Algorithms for a network design problem with crossing supermodular demands (Q4474300) (← links)
- Approximating Minimum Cost Connectivity Orientation and Augmentation (Q4606698) (← links)
- ON THE VERTEX-CONNECTIVITY PROBLEM FOR GRAPHS WITH SHARPENED TRIANGLE INEQUALITY (Q4667918) (← links)
- A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs (Q5002603) (← links)
- Approximation algorithms for graph augmentation (Q5204328) (← links)
- Two-Connected Spanning Subgraphs with at Most $\frac{10}{7}{OPT}$ Edges (Q5351864) (← links)
- An Improved Approximation Algorithm for the Matching Augmentation Problem (Q5883280) (← links)
- Fast exact algorithms for survivable network design with uniform requirements (Q5918784) (← links)
- Probabilistic properties of highly connected random geometric graphs (Q5919114) (← links)
- Correlation clustering and two-edge-connected augmentation for planar graphs (Q6046943) (← links)
- Approximation algorithms for flexible graph connectivity (Q6120848) (← links)
- Color-avoiding connected spanning subgraphs with minimum number of edges (Q6130205) (← links)