A solver for the (unicost) set covering problem
-
Updated
Oct 31, 2026 - C++
A solver for the (unicost) set covering problem
Clustering tool optimized for sparse distance matrices: ~16M elements with ~190M connections clustered in minutes.
A package for biomarker selection based on multiset multicover and the cross-entropy-method.
Combinatorial Optimization and Graph Algorithms in Julia
ARGOS — AOI inspection planning solver for the 4th Koh Young AI Competition (ICCAS 2026)
Quandle coloring and 2-cocycle invariants for distinguishing prime knots with fewer than 10 crossings
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.
Minimal keys and row-wise value-of-information for disambiguating tabular records
내 구독 기준으로 '이 작품을 가장 싸게 보는 법'을 판단하고, 위시리스트를 다 보는 최적 구독 조합을 계산하는 국내 OTT 의사결정 도구 (Next.js 16 · TMDB)
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?
Demonstration to solve the Set Cover problem
Heuristic solver for optimal camera placement (Art Gallery Problem, NP-hard) with raycasting-based line-of-sight and limited FOV.
MSc thesis (Univ. of Padova): a seq2seq Transformer that learns to solve Set Cover, evaluated with a 5-way error taxonomy. PyTorch.
To associate your repository with the set-cover topic, visit your repo's landing page and select "manage topics."