Recommendations
- Generalized budgeted submodular set function maximization
- Improved greedy algorithm for maximum coverage problem with group budget constraints
- scientific article; zbMATH DE number 6851883
- scientific article; zbMATH DE number 1953104
- Approximation algorithms for maximum coverage with group budget constraints
Cited in
(only showing first 100 items - show all)- Online algorithms for the maximum \(k\)-interval coverage problem
- A note on the clustered set covering problem
- A refined analysis of submodular greedy
- Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs
- A continuous knapsack problem with separable convex utilities: approximation algorithms and applications
- Approximation algorithm of maximizing non-submodular functions under non-submodular constraint
- scientific article; zbMATH DE number 7204409 (Why is no real title available?)
- Maximize a monotone function with a generic submodularity ratio
- A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access
- An almost optimal approximation algorithm for monotone submodular multiple knapsack
- Approximations for restrictions of the budgeted and generalized maximum coverage problems
- Cut problems in graphs with a budget constraint
- Randomized greedy methods for weak submodular sensor selection with robustness considerations
- Efficient approximation algorithms for maximum coverage with group budget constraints
- Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem
- Maximization of nonsubmodular functions under multiple constraints with applications
- scientific article; zbMATH DE number 1953104 (Why is no real title available?)
- Practical budgeted submodular maximization
- Data source selection for approximate query
- An improved analysis of the Greedy+Singleton algorithm for \(k\)-submodular knapsack maximization
- Approximation algorithms and hardness results for labeled connectivity problems
- Approximation and hardness results for label cut and related problems
- Optimizing node discovery on networks: problem definitions, fast algorithms, and observations
- A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint
- Online budgeted maximum coverage
- The multi-budget maximum weighted coverage problem
- Online budgeted maximum coverage
- Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs
- Improved deterministic algorithms for non-monotone submodular maximization
- Introducing time series snippets: a new primitive for summarizing long time series
- Optimization with demand oracles
- Minimizing the Spread of Rumor Within Budget Constraint in Online Network
- Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems
- The generalized maximum coverage problem
- Algorithms for covering multiple submodular constraints and applications
- On partial covering for geometric set systems
- Improved deterministic algorithms for non-monotone submodular maximization
- The impact of partial production capacity sharing via production as a service
- Recommending links through influence maximization
- A note on the set union knapsack problem
- An improved approximation algorithm for the most points covering problem
- Accelerated Benders decomposition and local branching for dynamic maximum covering location problems
- A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint
- On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs
- Constrained submodular maximization via a nonsymmetric technique
- On approximating four covering and packing problems
- A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints
- On the Parameterized Complexity of the Expected Coverage Problem
- Exploiting submodularity to quantify near-optimality in multi-agent coverage problems
- Partial vertex cover and budgeted maximum coverage in bipartite graphs
- Maximum coverage with cluster constraints: an LP-based approximation technique
- Algorithms for storage allocation based on client preferences
- 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
- On the parameterized complexity of the expected coverage problem
- On the partial vertex cover problem in bipartite graphs -- a parameterized perspective
- An approximation algorithm for maximum weight budgeted connected set cover
- The Budgeted Unique Coverage Problem and Color-Coding
- Video distribution under multiple constraints
- Parameter estimation in epidemic spread networks using limited measurements
- Pareto optimization for subset selection with dynamic cost constraints
- Monotone \(k\)-submodular knapsack maximization: an analysis of the Greedy+Singleton algorithm
- Maximizing a non-decreasing non-submodular function subject to various types of constraints
- Maximum betweenness centrality: approximability and tractable cases
- Streaming submodular maximization with the chance constraint
- A note on maximizing a submodular set function subject to a knapsack constraint
- Multiple voting location and single voting location on trees
- Maximizing misinformation restriction within time and budget constraints
- The parameterized complexity of unique coverage and its variants
- Approximation of the clustered set covering problem
- Maximum weighted independent sets with a budget
- Better streaming algorithms for the maximum coverage problem
- Approximating the optimal sequence of acquisitions and sales with a capped budget
- Tight approximation bounds for maximum multi-coverage
- Performance bounds with curvature for batched greedy optimization
- Aerial vehicle search-path optimization: a novel method for emergency operations
- Energy-constrained geometric coverage problem
- Tight approximation bounds for maximum multi-coverage
- Budget-constrained cost-covering job assignment for a total contribution-maximizing platform
- Towards more efficient infection and fire fighting
- Dual domination problems in graphs
- Non-monotone submodular function maximization under \(k\)-system constraint
- A 1/2 approximation algorithm for energy-constrained geometric coverage problem
- Tight Approximation Bounds for the Seminar Assignment Problem
- A new greedy strategy for maximizing monotone submodular function under a cardinality constraint
- scientific article; zbMATH DE number 6851883 (Why is no real title available?)
- Bounded-hops power assignment in ad hoc wireless networks
- A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem
- Improved budgeted connected domination and budgeted edge-vertex domination
- On the Minimum Hitting Set of Bundles Problem
- Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem
- Behavioral model summarisation for other agents under uncertainty
- Combination Can Be Hard: Approximability of the Unique Coverage Problem
- Submodular Maximization Subject to a Knapsack Constraint Under Noise Models
- Budgeted maximum coverage with overlapping costs: monitoring the emerging infections network
- On the inapproximability of maximum intersection problems
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- \textsc{Greedy+Singleton}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization
- Improved approximation algorithms for \(k\)-submodular maximization under a knapsack constraint
- A two-stage stochastic programming approach for influence maximization in social networks
- Problems and algorithms for covering arrays via set covers
This page was built for publication: The budgeted maximum coverage problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1606925)
