Algorithms for covering multiple submodular constraints and applications
From MaRDI portal
Publication:2165261
Recommendations
- Maximizing submodular set functions subject to multiple linear constraints
- A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem
- Greedy -approximation algorithm for covering with arbitrary constraints and submodular cost
- Fast algorithms for maximizing submodular functions
- Greedy ${\ensuremath{\Delta}}$ -Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
Cites work
- A note on maximizing a submodular set function subject to a knapsack constraint
- A unified approach to approximating partial covering problems
- Algorithms for dominating set in disk graphs: breaking the \(\log n\) barrier (extended abstract)
- Algorithms for facility location problems with outliers. (Extended abstract)
- Almost optimal set covers in finite VC-dimension
- An analysis of approximations for maximizing submodular set functions—I
- An analysis of the greedy algorithm for the submodular set covering problem
- Analytical approach to parallel repetition
- Approximation algorithm for vertex cover with multiple covering constraints
- Approximation algorithms for clustering problems with lower bounds and outliers
- Approximation algorithms for covering/packing integer programs
- Approximation algorithms for partial covering problems
- Approximation algorithms for the partition vertex cover problem
- Clustering to minimize the sum of cluster diameters
- Epsilon nets and union complexity
- Geometric red-blue set cover for unit squares and related problems
- scientific article; zbMATH DE number 1445293 (Why is no real title available?)
- Improved approximation algorithms for geometric set cover
- Improved bound for the union of fat triangles
- Maximizing a monotone submodular function subject to a matroid constraint
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
- On approximating (sparse) covering integer programs
- On multiplicative weight updates for concave and submodular function maximization
- On partial covering for geometric set systems
- Optimal approximation for the submodular welfare problem in the value oracle model
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee
- Small-size -nets for axis-parallel rectangles and boxes
- The budgeted maximum coverage problem
- Using homogeneous weights for approximating the partial cover problem
- Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
- Weighted geometric set cover via quasi-uniform sampling
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
Cited in
(16)- New algorithms for the intersection problem of submodular systems
- Greedy -approximation algorithm for covering with arbitrary constraints and submodular cost
- Tight approximation bounds for maximum multi-coverage
- A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem
- All-norms and all-L_p-norms approximation algorithms
- Greedy ${\ensuremath{\Delta}}$ -Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
- Tight approximation bounds for maximum multi-coverage
- Prize‐collecting set multicovering with submodular pricing
- A bicriteria approximation algorithm for minimum submodular cost partial multi-cover problem
- A parameterized approximation scheme for generalized partial vertex cover
- Approximation algorithm for prize-collecting vertex cover with fairness constraints
- On approximating partial scenario set cover
- Satisfiability to coverage in presence of fairness, matroid, and global constraints
- On generalizations of partial scenario set cover
- Approximation algorithms for the partition set cover problem with penalties
- Constant FPT approximation algorithms for colorful sum of radii
This page was built for publication: Algorithms for covering multiple submodular constraints and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2165261)
