AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Solving Set Cover and Dominating Set via Maximum Satisfiability

Zhendong Lei, Shaowei Cai

AAAI 2020 · Learning theory and algorithms › Combinatorial and search optimization · approach: Heuristic and local search algorithms · 13 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
add reduction rules (ablation)DomSAT · weighted DSP#win: 10 -> 38Improved
add reduction rules (ablation)DomSAT · unweighted DSP#win: 4 -> 63Improved
add configuration checking (ablation)DomSAT · weighted DSP#win: 21 -> 38Improved
add configuration checking (ablation)DomSAT · unweighted DSP#win: 31 -> 63Improved
add aspiration mode (ablation)DomSAT · weighted DSP#win: 9 -> 38Improved
add aspiration mode (ablation)DomSAT · unweighted DSP#win: 23 -> 63Improved
add reduction rules (ablation)DomSAT · Rail SCP#win: 0 -> 5Improved
add reduction, CC or aspiration (ablation)DomSAT · STS and OR small instances#winNo clear effect
add reduction rules (ablation)DomSAT · rail1 weighted SCPmin cost: 712 -> 703Improved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy