Pages that link to "Item:Q4719338"
From MaRDI portal
The following pages link to A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph (Q4719338):
Displaying 20 items.
- Improved approximation algorithms for single-tiered relay placement (Q266064) (← links)
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633) (← links)
- Degree constrained node-connectivity problems (Q486998) (← links)
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem (Q494800) (← links)
- Approximating survivable networks with \(\beta \)-metric costs (Q553954) (← links)
- Relay placement for fault tolerance in wireless networks in higher dimensions (Q632722) (← links)
- On minimum power connectivity problems (Q972357) (← links)
- On \(k\)-connectivity problems with sharpened triangle inequality (Q1002105) (← links)
- Approximating minimum-power edge-covers and 2,3-connectivity (Q1026146) (← links)
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) (← links)
- Power assignment for \(k\)-connectivity in wireless ad hoc networks (Q1781807) (← links)
- Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems (Q1799605) (← links)
- Approximation algorithms for vertex-connectivity augmentation on the cycle (Q2085731) (← links)
- A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
- Relay placement for two-connectivity (Q2339829) (← links)
- Approximating subset \(k\)-connectivity problems (Q2376789) (← links)
- On extremal \(k\)-outconnected graphs (Q2427512) (← links)
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
- ON THE VERTEX-CONNECTIVITY PROBLEM FOR GRAPHS WITH SHARPENED TRIANGLE INEQUALITY (Q4667918) (← links)
- Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems (Q5740195) (← links)