Pages that link to "Item:Q2379694"
From MaRDI portal
The following pages link to Greedy approximations for minimum submodular cover with submodular cost (Q2379694):
Displayed 10 items.
- On minimum submodular cover with submodular cost (Q540698) (← links)
- An approximation algorithm for submodular hitting set problem with linear penalties (Q830939) (← links)
- Approximations for node-weighted Steiner tree in unit disk graphs (Q1958644) (← links)
- Optimal RSUs placement with delay bounded message dissemination in vehicular networks (Q2012886) (← links)
- On the approximability and hardness of the minimum connected dominating set with routing cost constraint (Q2326407) (← links)
- PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs (Q2352346) (← links)
- Handling least privilege problem and role mining in RBAC (Q2352353) (← links)
- A cross-monotonic cost-sharing scheme for the concave facility location game (Q2393059) (← links)
- Algorithm 996 (Q4960955) (← links)
- A Tight Bound for Stochastic Submodular Cover (Q5009701) (← links)