Pages that link to "Item:Q1606925"
From MaRDI portal
The following pages link to The budgeted maximum coverage problem (Q1606925):
Displayed 50 items.
- An approximation algorithm for maximum weight budgeted connected set cover (Q281790) (← links)
- Maximum entropy models and subjective interestingness: an application to tiles in binary databases (Q408667) (← links)
- On the inapproximability of maximum intersection problems (Q456103) (← links)
- On the computational complexity of measuring global stability of banking networks (Q487019) (← links)
- A note on the clustered set covering problem (Q496643) (← links)
- Maximizing a submodular function with viability constraints (Q513299) (← links)
- Video distribution under multiple constraints (Q551203) (← links)
- Approximation and hardness results for label cut and related problems (Q630189) (← links)
- An improved approximation algorithm for the most points covering problem (Q692901) (← links)
- Performance bounds with curvature for batched greedy optimization (Q725886) (← links)
- Flow intercepting facility location: Problems, models and heuristics (Q841607) (← links)
- Multiple voting location and single voting location on trees (Q877040) (← links)
- The generalized maximum coverage problem (Q963466) (← links)
- Algorithms for storage allocation based on client preferences (Q975763) (← links)
- An \(O(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees (Q976129) (← links)
- On approximating four covering and packing problems (Q1021577) (← links)
- A note on maximizing a submodular set function subject to a knapsack constraint (Q1433658) (← links)
- Maximum coverage problem with group budget constraints (Q1680483) (← links)
- Welfare maximization with friends-of-friends network externalities (Q1693985) (← links)
- Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem (Q1702134) (← links)
- Recommending links through influence maximization (Q1731508) (← links)
- Exploiting submodularity to quantify near-optimality in multi-agent coverage problems (Q1737663) (← links)
- A two-stage stochastic programming approach for influence maximization in social networks (Q1744898) (← links)
- Maximizing misinformation restriction within time and budget constraints (Q1752625) (← links)
- A continuous knapsack problem with separable convex utilities: approximation algorithms and applications (Q1785255) (← links)
- The knapsack problem with neighbour constraints (Q1932367) (← links)
- Maximum subset intersection (Q1944892) (← links)
- Critical nodes in interdependent networks with deterministic and probabilistic cascading failures (Q2274858) (← links)
- On the fuzzy maximal covering location problem (Q2286987) (← links)
- Constrained submodular maximization via greedy local search (Q2294252) (← links)
- Better streaming algorithms for the maximum coverage problem (Q2322721) (← links)
- Approximation algorithms for the geometric firefighter and budget fence problems (Q2331446) (← links)
- Problems and algorithms for covering arrays via set covers (Q2333828) (← links)
- The parameterized complexity of unique coverage and its variants (Q2392923) (← links)
- Aerial vehicle search-path optimization: a novel method for emergency operations (Q2397472) (← links)
- Optimization with demand oracles (Q2414860) (← links)
- Approximation algorithms and hardness results for labeled connectivity problems (Q2426652) (← links)
- A note on the set union knapsack problem (Q2449074) (← links)
- Cut problems in graphs with a budget constraint (Q2457298) (← links)
- A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access (Q2488215) (← links)
- Bounded-hops power assignment in ad hoc wireless networks (Q2492211) (← links)
- TOWARDS MORE EFFICIENT INFECTION AND FIRE FIGHTING (Q2841981) (← links)
- Approximation of the Clustered Set Covering Problem (Q2883599) (← links)
- Discrete Stochastic Submodular Maximization: Adaptive vs. Non-adaptive vs. Offline (Q2947023) (← links)
- Tight Approximation Bounds for the Seminar Assignment Problem (Q2971167) (← links)
- Maximum Betweenness Centrality: Approximability and Tractable Cases (Q3078375) (← links)
- The Budgeted Unique Coverage Problem and Color-Coding (Q3392967) (← links)
- Online Allocation and Pricing with Economies of Scale (Q3460785) (← links)
- Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem (Q3512450) (← links)
- Constrained Submodular Maximization via a Nonsymmetric Technique (Q5108227) (← links)