Maximum coverage problem with group budget constraints and applications
From MaRDI portal
Recommendations
- Approximation algorithms for maximum coverage with group budget constraints
- Maximum coverage problem with group budget constraints
- Efficient approximation algorithms for maximum coverage with group budget constraints
- Improved greedy algorithm for maximum coverage problem with group budget constraints
- The budgeted maximum coverage problem
Cited in
(46)- Maximum coverage problem with group budget constraints
- Approximation algorithms for maximum coverage with group budget constraints
- Spider covers and their applications
- Generalized budgeted submodular set function maximization
- Locally defined independence systems on graphs
- Maximum coverage with cluster constraints: an LP-based approximation technique
- Siting renewable power generation assets with combinatorial optimisation
- Faster algorithms for orienteering and \(k\)-TSP
- Minimum hitting set of interval bundles problem: computational complexity and approximability
- Mobile facility location: combinatorial filtering via weighted occupancy
- An approximation algorithm for vehicle routing with compatibility constraints
- Efficient approximation algorithms for maximum coverage with group budget constraints
- Better streaming algorithms for the maximum coverage problem
- Approximability of the firefighter problem. Computing cuts over time
- Approximation algorithms for the traveling repairman and speeding deliveryman problems
- Approximating the \(k\)-traveling repairman problem with repair times
- The multi-budget maximum weighted coverage problem
- Capacitated vehicle routing with nonuniform speeds
- Capacitated vehicle routing with non-uniform speeds
- Improved approximation algorithms for the min-max tree cover and bounded tree cover problems
- scientific article; zbMATH DE number 6851883 (Why is no real title available?)
- Generalized budgeted submodular set function maximization
- Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems
- Precedence-Constrained Min Sum Set Cover
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
- Video distribution under multiple constraints
- scientific article; zbMATH DE number 7053373 (Why is no real title available?)
- Deadline TSP
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph
- Improved and generalized algorithms for burning a planar point set
- Groups burning: analyzing spreading processes in community-based networks
- Resource time-sharing for IoT applications with deadlines
- Energy-constrained geometric coverage problem
- A 1/2 approximation algorithm for energy-constrained geometric coverage problem
- Approximation algorithms for maximum weighted target cover problem with distance limitations
- Time-sharing scheduling with tolerance capacities
- Approximation algorithm for fair stochastic maximum coverage problem
- A PTAS for the budgeted power maximum coverage problem
- Online time-windows TSP with predictions
- A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
- How to allocate review tasks for robust ranking
- Constant-factor approximation to deadline TSP and related problems in (almost) quasi-polytime
- Minimizing latency of capacitated \(k\)-tours
- A (5/3+)-approximation for tricolored non-crossing Euclidean TSP
- Approximation schemes for orienteering and deadline TSP in doubling metrics
This page was built for publication: Maximum coverage problem with group budget constraints and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5313048)
