AI Paper Atlas

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

Exact Optimization for Minimum Dominating Sets

Enqiang Zhu, Qiqi Bao, Yu Zhang, Chanjuan Liu, Pu Wu

AAAI 2026 · Learning theory and algorithms › Combinatorial and search optimization · approach: Unsupervised neural combinatorial optimization · 1 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 the enhanced multi-LP lower bound to ParDS-LP (replacing conventional LP) (ablation)ParDS · T1 V300E750 and V250E750 (20 instances)running time and vertex selections: V300E750 0: 5086 -> 4474 s; 184889 -> 180646 selectionsImproved
add the new reduction rules on top of BIBLP's conventional LP (ablation)BIBLP / ParDS-LP · T1 V300E750 and V250E750 (20 instances)running time and vertex selections: faster in 17 of 20 instances; fewer vertex selections in allImproved
use ParDS instead of BIBLP on dense BD3 graphsParDS · BD3 (dense)running time: BIBLP 1456.34(3) vs ParDS 2586.34(4)Hurt
use ParDS instead of BIBLP on UDG graphsParDS · UDGrunning time: |V|=1000 B: 0.42 -> 16.33Hurt
use ParDS instead of BIBLP on sparse T1 graphsParDS · T1 (19 of 25 categories fastest)running time: |V|=250, |E|=750: 678.11 -> 200.66Improved
use ParDS instead of BIBLP on BD6 graphsParDS · BD6running time: 0.17 -> 0.08Improved

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