Pages that link to "Item:Q2031056"
From MaRDI portal
The following pages link to Approximation algorithms for the submodular edge cover problem with submodular penalties (Q2031056):
Displaying 9 items.
- Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique (Q278736) (← links)
- A note on the submodular vertex cover problem with submodular penalties (Q730006) (← links)
- An approximation algorithm for submodular hitting set problem with linear penalties (Q830939) (← links)
- Approximation algorithm for stochastic set cover problem (Q2039642) (← links)
- An approximation algorithm for the generalized prize-collecting Steiner forest problem with submodular penalties (Q2136518) (← links)
- Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties (Q2353460) (← links)
- Greedy approximations for minimum submodular cover with submodular cost (Q2379694) (← links)
- Approximation Algorithms for Edge-Covering Problem (Q3628568) (← links)
- A bicriteria approximation algorithm for minimum submodular cost partial multi-cover problem (Q6049083) (← links)