scientific article; zbMATH DE number 1323125
From MaRDI portal
Publication:4255028
Recommendations
Cited in
(54)- An application of the greedy heuristic of set cover to traffic checks
- Two-stage flexible-choice problems under uncertainty
- Computing approximate solutions of the maximum covering problem with GRASP
- The gradual covering decay location problem on a network.
- Generalized submodular cover problems and applications
- Carousel greedy: a generalized greedy algorithm with applications in optimization
- Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs
- Calculating approximation guarantees for partial set cover of pairs
- Relational data factorization
- Near-linear time approximation schemes for geometric maximum coverage
- Approximation of a maximum-submodular-coverage problem involving spectral functions, with application to experimental designs
- Greedy -approximation algorithm for covering with arbitrary constraints and submodular cost
- Online budgeted maximum coverage
- Maximum rooted connected expansion
- Online algorithms for the maximum \(k\)-interval coverage problem
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
- Tight approximation bounds for maximum multi-coverage
- Siting renewable power generation assets with combinatorial optimisation
- Discrete optimization methods for group model selection in compressed sensing
- Solving SAT in a distributed cloud: a portfolio approach
- Approximation algorithms for connected maximum coverage problem for the discovery of mutated driver pathways in cancer
- Problems and algorithms for covering arrays via set covers
- Inequalities on submodular functions via term rewriting
- A note on the set union knapsack problem
- Interactive optimization of submodular functions under matroid constraints
- Pairs Covered by a Sequence of Sets
- Tight approximation bounds for greedy frugal coverage algorithms
- Online maximum \(k\)-coverage
- Linear Time Approximation Schemes for Geometric Maximum Coverage
- scientific article; zbMATH DE number 3863198 (Why is no real title available?)
- Covering analysis of the greedy algorithm for partial cover
- Mining representative subset based on fuzzy clustering
- Quotient geometric crossovers and redundant encodings
- scientific article; zbMATH DE number 1305498 (Why is no real title available?)
- Online maximum \(k\)-coverage
- Combinatorial approximation of maximum \(k\)-vertex cover in bipartite graphs within ratio 0,7
- The capacitated orienteering problem
- Tight approximation bounds for maximum multi-coverage
- Approximation algorithms for maximum weight k-coverings of graphs by packings
- Budgeted maximum coverage with overlapping costs: monitoring the emerging infections network
- Bounds on the Performance of a Greedy Algorithm for Probabilities
- scientific article; zbMATH DE number 7650099 (Why is no real title available?)
- The generalized maximal covering location problem
- Matroid-constrained vertex cover
- A note on robust subsets of transversal matroids
- Average case analysis of greedy algorithms for optimisation problems on set systems
- On the fine-grained complexity of approximating max k-coverage
- Improved algorithms for maximum coverage in dynamic and random order streams
- Performance bounds with curvature for batched greedy optimization
- Efficient mathematical programming formulation and algorithmic framework for optimal camera placement
- Phylogenetic diversity and the maximum coverage problem
- Domination and coverage problems under vulnerability constraints
- Covering weighted points using unit squares
- The generalized maximum coverage problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4255028)
