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
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 changed | Where | Measured | Effect |
|---|---|---|---|
| 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 selections | Improved |
| 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 all | Improved |
| use ParDS instead of BIBLP on dense BD3 graphs | ParDS · BD3 (dense) | running time: BIBLP 1456.34(3) vs ParDS 2586.34(4) | Hurt |
| use ParDS instead of BIBLP on UDG graphs | ParDS · UDG | running time: |V|=1000 B: 0.42 -> 16.33 | Hurt |
| use ParDS instead of BIBLP on sparse T1 graphs | ParDS · T1 (19 of 25 categories fastest) | running time: |V|=250, |E|=750: 678.11 -> 200.66 | Improved |
| use ParDS instead of BIBLP on BD6 graphs | ParDS · BD6 | running time: 0.17 -> 0.08 | Improved |
Closest papers by meaning
- A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem (AAAI 2024 · similarity 0.83)
- KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum k-Defective Clique Problem (AAAI 2024 · similarity 0.82)
- Bayesian Optimization of Functions over Node Subsets in Graphs (NeurIPS 2024 · similarity 0.82)
- Differentiable Quadratic Optimization For the Maximum Independent Set Problem (ICML 2025 · similarity 0.82)
- Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover (AAAI 2024 · similarity 0.82)
- Pre-Assignment Problem for Unique Minimum Vertex Cover on Bounded Clique-Width Graphs (AAAI 2025 · similarity 0.81)
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.
