Pages that link to "Item:Q4255028"

The following pages link to Analysis of the greedy approach in problems of maximum \(k\)-coverage (Q4255028):

Displaying 43 items.

• Quotient geometric crossovers and redundant encodings (Q418019) (← links)
• Online maximum \(k\)-coverage (Q442204) (← links)
• The capacitated orienteering problem (Q496434) (← links)
• Average case analysis of greedy algorithms for optimisation problems on set systems (Q672472) (← links)
• Performance bounds with curvature for batched greedy optimization (Q725886) (← links)
• Phylogenetic diversity and the maximum coverage problem (Q735104) (← links)
• The generalized maximum coverage problem (Q963466) (← links)
• An application of the greedy heuristic of set cover to traffic checks (Q1022400) (← links)
• Two-stage flexible-choice problems under uncertainty (Q1037661) (← links)
• Computing approximate solutions of the maximum covering problem with GRASP (Q1273660) (← links)
• The gradual covering decay location problem on a network. (Q1410306) (← links)
• Generalized submodular cover problems and applications (Q1589434) (← links)
• Carousel greedy: a generalized greedy algorithm with applications in optimization (Q1652355) (← links)
• Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs (Q1662108) (← links)
• Calculating approximation guarantees for partial set cover of pairs (Q1676481) (← links)
• Relational data factorization (Q1699908) (← links)
• Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← links)
• Approximation of a maximum-submodular-coverage problem involving spectral functions, with application to experimental designs (Q1759885) (← links)
• Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
• Online budgeted maximum coverage (Q1979466) (← links)
• Maximum rooted connected expansion (Q2034397) (← links)
• Online algorithms for the maximum \(k\)-interval coverage problem (Q2091105) (← links)
• Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems (Q2097628) (← links)
• Siting renewable power generation assets with combinatorial optimisation (Q2119746) (← links)
• Discrete optimization methods for group model selection in compressed sensing (Q2235146) (← links)
• Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
• Solving SAT in a distributed cloud: a portfolio approach (Q2299084) (← links)
• Approximation algorithms for connected maximum coverage problem for the discovery of mutated driver pathways in cancer (Q2308460) (← links)
• Problems and algorithms for covering arrays via set covers (Q2333828) (← links)
• Inequalities on submodular functions via term rewriting (Q2444736) (← links)
• A note on the set union knapsack problem (Q2449074) (← links)
• Interactive optimization of submodular functions under matroid constraints (Q2695451) (← links)
• Pairs Covered by a Sequence of Sets (Q2947882) (← links)
• Online Maximum k-Coverage (Q3088282) (← links)
• Linear Time Approximation Schemes for Geometric Maximum Coverage (Q3196415) (← links)
• Mining representative subset based on fuzzy clustering (Q3610438) (← links)
• (Q4252388) (← links)
• Combinatorial approximation of maximum <i>k</i>-vertex cover in bipartite graphs within ratio 0.7 (Q4579900) (← links)
• Approximation algorithms for maximum weight <i>k</i>-coverings of graphs by packings (Q5063275) (← links)
• (Q5875486) (← links)
• The generalized maximal covering location problem (Q5959382) (← links)
• Matroid-constrained vertex cover (Q6162073) (← links)
• A note on robust subsets of transversal matroids (Q6586976) (← links)