Pages that link to "Item:Q3167388"

The following pages link to Prize-Collecting Survivable Network Design in Node-Weighted Graphs (Q3167388):

Displaying 10 items.

• Covering problems in edge- and node-weighted graphs (Q1751155) (← links)
• Approximation algorithms for highly connected multi-dominating sets in unit disk graphs (Q1755744) (← links)
• Approximation algorithm for the partial set multi-cover problem (Q2010112) (← links)
• On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q2117101) (← links)
• Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems (Q4571047) (← links)
• Spider Covering Algorithms for Network Design Problems (Q4689626) (← links)
• (Q5240415) (← links)
• (Q5240417) (← links)
• Approximating node-weighted \(k\)-MST on planar graphs (Q5918856) (← links)
• On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q6200809) (← links)