Pages that link to "Item:Q4719339"
From MaRDI portal
The following pages link to A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs (Q4719339):
Displaying 12 items.
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633) (← 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)
- A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
- Approximating subset \(k\)-connectivity problems (Q2376789) (← links)
- ON THE VERTEX-CONNECTIVITY PROBLEM FOR GRAPHS WITH SHARPENED TRIANGLE INEQUALITY (Q4667918) (← links)
- A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph (Q4719338) (← links)
- Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems (Q5740195) (← links)
