A solver for the (unicost) set covering problem
-
Updated
Apr 18, 2026 - C++
A solver for the (unicost) set covering problem
A package for biomarker selection based on multiset multicover and the cross-entropy-method.
Combinatorial Optimization and Graph Algorithms in Julia
Package for estimating geometric set covers and tangent bundles
Empirical study of greedy approximation for minimum-weight correction subsets on Hindley–Milner-style constraint systems.
내 구독 기준으로 '이 작품을 가장 싸게 보는 법'을 판단하고, 위시리스트를 다 보는 최적 구독 조합을 계산하는 국내 OTT 의사결정 도구 (Next.js 16 · TMDB)
Demonstration to solve the Set Cover problem
Résumé-Job Matching & Talent-Marketplace Engine — DSA-3 (25CS2103E) semester project, hand-built algorithmic core (string algorithms, DP, network flow, NP-hard approximation, randomized/parallel algorithms).
Reproducibility artifact for orbit-resolved spectra and dynamical accessibility in multi-register covering Hamiltonians
Simulation benchmark for LLM serving observability design: which minimum set of signals detects all major failure modes before SLO violation, and what does each signal miss?
Heuristic solver for optimal camera placement (Art Gallery Problem, NP-hard) with raycasting-based line-of-sight and limited FOV.
Set-cover optimization for EV charging station placement, visualized on a real city map. ESG and infrastructure consulting use case.
Rust terminal application for solving the weighted set cover problem using greedy and exact algorithms.
To associate your repository with the set-cover topic, visit your repo's landing page and select "manage topics."