Pages that link to "Item:Q5048953"
From MaRDI portal
The following pages link to Better algorithms for minimum weight vertex-connectivity problems (Q5048953):
Displaying 7 items.
- An approximation algorithm for minimum-cost vertex-connectivity problems (Q679445) (← links)
- Faster approximation algorithms for weighted triconnectivity augmentation problems (Q1267191) (← links)
- Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems (Q1849676) (← links)
- Pruning 2-connected graphs (Q3165952) (← links)
- A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph (Q4719338) (← links)
- A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs (Q4719339) (← links)
- A better subgraph of the minimum weight triangulation (Q6085740) (← links)