Pages that link to "Item:Q2353460"
From MaRDI portal
The following pages link to Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties (Q2353460):
Displaying 8 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)
- On approximation of the submodular set cover problem (Q1969763) (← links)
- Approximation algorithms for the submodular edge cover problem with submodular penalties (Q2031056) (← links)
- Approximation algorithm for stochastic set cover problem (Q2039642) (← links)
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP (Q2452383) (← links)
- Approximation and Online Algorithms (Q5713434) (← links)