Pages that link to "Item:Q3557046"
From MaRDI portal
The following pages link to Prize-Collecting Steiner Networks via Iterative Rounding (Q3557046):
Displayed 5 items.
- On some network design problems with degree constraints (Q355516) (← links)
- Euclidean prize-collecting Steiner forest (Q2429324) (← links)
- Network-Design with Degree Constraints (Q3088102) (← links)
- On the Integrality Gap of the Prize-Collecting Steiner Forest LP (Q5002620) (← links)
- Approximation algorithms for prize-collecting capacitated network design problems (Q6111480) (← links)