Pages that link to "Item:Q2379971"
From MaRDI portal
The following pages link to Primal-dual approximation algorithms for the prize-collecting Steiner tree problem (Q2379971):
Displaying 8 items.
- Risk models for the prize collecting Steiner tree problems with interval data (Q403434) (← links)
- Approximation algorithms for group prize-collecting and location-routing problems (Q1003471) (← links)
- A fast prize-collecting Steiner forest algorithm for functional analyses in biological networks (Q2011601) (← links)
- Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem (Q2165784) (← links)
- Complexity and approximation for traveling salesman problems with profits (Q2441781) (← links)
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem (Q2583134) (← links)
- Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree (Q5012805) (← links)
- On the Exact Solution of Prize-Collecting Steiner Tree Problems (Q5085996) (← links)
