Pages that link to "Item:Q4571047"
From MaRDI portal
The following pages link to Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems (Q4571047):
Displaying 4 items.
- Improved methods for approximating node weighted Steiner trees and connected dominating sets. (Q1854264) (← links)
- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time (Q2098029) (← links)
- 2-node-connectivity network design (Q2117701) (← links)
- 2-node-connectivity network design (Q6122594) (← links)