Pages that link to "Item:Q5390585"
From MaRDI portal
The following pages link to Approximating Steiner Networks with Node-Weights (Q5390585):
Displaying 13 items.
- Survivable network activation problems (Q386909) (← links)
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem (Q494800) (← links)
- Covering problems in edge- and node-weighted graphs (Q1751155) (← links)
- Approximation algorithm for the partial set multi-cover problem (Q2010112) (← links)
- Approximating Survivable Networks with Minimum Number of Steiner Points (Q3075458) (← links)
- The Densest $k$-Subhypergraph Problem (Q3174693) (← links)
- Spider Covering Algorithms for Network Design Problems (Q4689626) (← links)
- Breaking the<i>r</i><sub>max</sub>Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem (Q4995101) (← links)
- Online Node-weighted Steiner Forest and Extensions via Disk Paintings (Q5737814) (← links)
- A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem (Q5963614) (← 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)
