Pages that link to "Item:Q5175992"
From MaRDI portal
The following pages link to Approximation algorithms for constrained for constrained node weighted steiner tree problems (Q5175992):
Displaying 11 items.
- Approximating some network design problems with node costs (Q638508) (← links)
- Improved methods for approximating node weighted Steiner trees and connected dominating sets. (Q1854264) (← links)
- Primal-dual approximation algorithms for node-weighted Steiner forest on planar graphs (Q1951588) (← links)
- Approximation schemes for node-weighted geometric Steiner tree problems (Q2391178) (← links)
- The node-weighted steiner tree problem (Q3789370) (← links)
- (Q4551390) (← links)
- (Q4887736) (← links)
- Approximating Steiner Networks with Node Weights (Q5458547) (← links)
- Variations of the prize‐collecting Steiner tree problem (Q5487807) (← links)
- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs (Q5505666) (← links)
- Approximation algorithms for minimum weight partial connected set cover problem (Q5963645) (← links)