Pages that link to "Item:Q5363079"
From MaRDI portal
The following pages link to Spider covers for prize-collecting network activation problem (Q5363079):
Displaying 7 items.
- Survivable network activation problems (Q386909) (← links)
- Covering problems in edge- and node-weighted graphs (Q1751155) (← links)
- Approximation algorithms for highly connected multi-dominating sets in unit disk graphs (Q1755744) (← links)
- Spider covers and their applications (Q1935978) (← links)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q2117101) (← links)
- Spider Covering Algorithms for Network Design Problems (Q4689626) (← links)
- A note on iterated rounding for the survivable network design problem (Q5240415) (← links)