The following pages link to (Q4255028):
Displaying 28 items.
- Quotient geometric crossovers and redundant encodings (Q418019) (← links)
- Online maximum \(k\)-coverage (Q442204) (← links)
- The capacitated orienteering problem (Q496434) (← links)
- Performance bounds with curvature for batched greedy optimization (Q725886) (← links)
- Two-stage flexible-choice problems under uncertainty (Q1037661) (← links)
- The gradual covering decay location problem on a network. (Q1410306) (← 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)
- 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)
- 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)
- Combinatorial approximation of maximum <i>k</i>-vertex cover in bipartite graphs within ratio 0.7 (Q4579900) (← links)
- (Q5875486) (← links)
- Matroid-constrained vertex cover (Q6162073) (← links)
