Pages that link to "Item:Q1606925"
From MaRDI portal
The following pages link to The budgeted maximum coverage problem (Q1606925):
Displayed 18 items.
- (Q5111292) (← links)
- On Partial Covering For Geometric Set Systems (Q5115815) (← links)
- Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems (Q5210996) (← links)
- Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs (Q5361234) (← links)
- A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem (Q5874514) (← links)
- Submodular Maximization Subject to a Knapsack Constraint Under Noise Models (Q5888385) (← links)
- Improved approximation algorithms for \(k\)-submodular maximization under a knapsack constraint (Q6065659) (← links)
- Maximization of nonsubmodular functions under multiple constraints with applications (Q6110009) (← links)
- Improved deterministic algorithms for non-monotone submodular maximization (Q6140348) (← links)
- On the partial vertex cover problem in bipartite graphs -- a parameterized perspective (Q6151150) (← links)
- Streaming submodular maximization with the chance constraint (Q6166877) (← links)
- Monotone \(k\)-submodular knapsack maximization: an analysis of the Greedy+Singleton algorithm (Q6167014) (← links)
- Energy-constrained geometric coverage problem (Q6167018) (← links)
- Improved deterministic algorithms for non-monotone submodular maximization (Q6168972) (← links)
- Behavioral model summarisation for other agents under uncertainty (Q6178356) (← links)
- \textsc{Greedy+Singleton}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization (Q6180752) (← links)
- Budget-constrained cost-covering job assignment for a total contribution-maximizing platform (Q6182924) (← links)
- Approximation algorithm of maximizing non-monotone non-submodular functions under knapsack constraint (Q6201343) (← links)