Pages that link to "Item:Q2136518"
From MaRDI portal
The following pages link to An approximation algorithm for the generalized prize-collecting Steiner forest problem with submodular penalties (Q2136518):
Displaying 4 items.
- A primal-dual algorithm for the generalized prize-collecting Steiner forest problem (Q1706681) (← links)
- Approximation algorithms for the submodular edge cover problem with submodular penalties (Q2031056) (← links)
- Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties (Q2082211) (← links)
- An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties (Q2167423) (← links)