The following pages link to (Q4255028):
Displaying 12 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)
- 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)
