Pages that link to "Item:Q963393"
From MaRDI portal
The following pages link to Elementary approximation algorithms for prize collecting Steiner tree problems (Q963393):
Displaying 13 items.
- Approximation algorithms for group prize-collecting and location-routing problems (Q1003471) (← links)
- A primal-dual approximation algorithm for the Steiner forest problem (Q1327312) (← links)
- A primal-dual algorithm for the generalized prize-collecting Steiner forest problem (Q1706681) (← links)
- An approximation algorithm for the generalized prize-collecting Steiner forest problem with submodular penalties (Q2136518) (← links)
- An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties (Q2167423) (← links)
- Primal-dual approximation algorithms for the prize-collecting Steiner tree problem (Q2379971) (← links)
- A 4-approximation algorithm for \(k\)-prize collecting Steiner tree problems (Q2414116) (← links)
- A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem (Q2421447) (← links)
- Euclidean prize-collecting Steiner forest (Q2429324) (← links)
- A Local-Search Algorithm for Steiner Forest (Q4993295) (← links)
- On the Integrality Gap of the Prize-Collecting Steiner Forest LP (Q5002620) (← links)
- Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree (Q5012805) (← links)
- A 2-approximation for the \(k\)-prize-collecting Steiner tree problem (Q5970779) (← links)
