Pages that link to "Item:Q963466"
From MaRDI portal
The following pages link to The generalized maximum coverage problem (Q963466):
Displaying 17 items.
- Maximum coverage problem with group budget constraints (Q1680483) (← links)
- Micro-review synthesis for multi-entity summarization (Q1741329) (← links)
- Generalized budgeted submodular set function maximization (Q2051778) (← links)
- A refined analysis of submodular greedy (Q2060587) (← links)
- Approximations for restrictions of the budgeted and generalized maximum coverage problems (Q2132403) (← links)
- How to catch a lion in the desert: on the solution of the coverage directed generation (CDG) problem (Q2245689) (← links)
- Preference elicitation and robust winner determination for single- and multi-winner social choice (Q2287202) (← links)
- Approximation algorithms for the geometric firefighter and budget fence problems (Q2331446) (← links)
- The multi-budget maximum weighted coverage problem (Q2692723) (← links)
- Practical budgeted submodular maximization (Q2701388) (← links)
- (Q4433722) (← links)
- (Q4608613) (← links)
- Generalized budgeted submodular set function maximization (Q5005131) (← links)
- Constant Approximation for the Lifetime Scheduling Problem of <i>p</i>-Percent Coverage (Q5058008) (← links)
- The Maximal Conditional Covering Problem (Q5689924) (← links)
- A hybrid solution method for the bi-objective traffic counting location problem using previous origin-destination trip tables (Q6088551) (← links)
- \textsc{Greedy+Singleton}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization (Q6180752) (← links)