Pages that link to "Item:Q974743"
From MaRDI portal
The following pages link to Approximating minimum power covers of intersecting families and directed edge-connectivity problems (Q974743):
Displaying 9 items.
- Survivable network activation problems (Q386909) (← links)
- Approximating minimum-cost edge-covers of crossing biset-families (Q397064) (← links)
- Approximating minimum power edge-multi-covers (Q498430) (← links)
- Approximating minimum-power degree and connectivity problems (Q547290) (← links)
- Listing minimal edge-covers of intersecting families with applications to connectivity problems (Q1003760) (← links)
- Improved approximation algorithms for minimum power covering problems (Q5919677) (← links)
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q6200809) (← links)
- A \(2\sqrt{2k}\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths (Q6663517) (← links)
