Pages that link to "Item:Q5326552"
From MaRDI portal
The following pages link to Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems (Q5326552):
Displaying 6 items.
- An approximation algorithm for maximum weight budgeted connected set cover (Q281790) (← links)
- A simple approximation algorithm for minimum weight partial connected set cover (Q1680500) (← links)
- Covering problems in edge- and node-weighted graphs (Q1751155) (← links)
- Spider Covering Algorithms for Network Design Problems (Q4689626) (← links)
- Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems (Q5210996) (← links)
- Approximating node-weighted \(k\)-MST on planar graphs (Q5918856) (← links)
