Pages that link to "Item:Q1606925"

The following pages link to The budgeted maximum coverage problem (Q1606925):

Displaying 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)
• Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs (Q820559) (← 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)
• Online budgeted maximum coverage (Q1979466) (← links)
• Non-monotone submodular function maximization under \(k\)-system constraint (Q2025102) (← links)
• Generalized budgeted submodular set function maximization (Q2051778) (← links)
• A refined analysis of submodular greedy (Q2060587) (← links)
• Pareto optimization for subset selection with dynamic cost constraints (Q2060721) (← links)
• An almost optimal approximation algorithm for monotone submodular multiple knapsack (Q2071828) (← links)
• Data source selection for approximate query (Q2084622) (← links)
• Online algorithms for the maximum \(k\)-interval coverage problem (Q2091105) (← links)
• Maximum coverage with cluster constraints: an LP-based approximation technique (Q2117688) (← links)
• Approximations for restrictions of the budgeted and generalized maximum coverage problems (Q2132403) (← links)
• On the parameterized complexity of the expected coverage problem (Q2135628) (← links)
• Dual domination problems in graphs (Q2136849) (← links)
• A new greedy strategy for maximizing monotone submodular function under a cardinality constraint (Q2141724) (← links)
• Maximizing a non-decreasing non-submodular function subject to various types of constraints (Q2154448) (← links)
• Algorithms for covering multiple submodular constraints and applications (Q2165261) (← links)
• Gaussian downlink user selection subject to access limit, power budget, and rate demands (Q2167901) (← links)
• Simple and efficient budget feasible mechanisms for monotone submodular valuations (Q2190400) (← links)
• Submodular optimization problems and greedy strategies: a survey (Q2197586) (← links)
• Optimizing node discovery on networks: problem definitions, fast algorithms, and observations (Q2201666) (← links)
• A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint (Q2203598) (← links)
• Introducing time series snippets: a new primitive for summarizing long time series (Q2212529) (← links)
• Maximize a monotone function with a generic submodularity ratio (Q2220848) (← links)