Pages that link to "Item:Q5171191"
From MaRDI portal
The following pages link to Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions (Q5171191):
Displayed 17 items.
- Survivable network activation problems (Q386909) (← links)
- Degree constrained node-connectivity problems (Q486998) (← links)
- Approximating survivable networks with \(\beta \)-metric costs (Q553954) (← links)
- Approximating fault-tolerant group-Steiner problems (Q764316) (← links)
- A note on Rooted Survivable Networks (Q990935) (← links)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q2117101) (← links)
- Approximability of capacitated network design (Q2354026) (← links)
- Approximating subset \(k\)-connectivity problems (Q2376789) (← links)
- Approximating node-connectivity augmentation problems (Q2429349) (← links)
- Approximating minimum cost source location problems with local vertex-connectivity demands (Q2434929) (← links)
- Approximability of Capacitated Network Design (Q3009752) (← links)
- Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands (Q3010423) (← links)
- An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity (Q3012788) (← links)
- (Q5240415) (← links)
- (Q5743494) (← links)
- Multi-priority graph sparsification (Q6182885) (← links)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q6200809) (← links)