Research map / Learning theory and algorithms / Sample complexity
New Lower Bound for the Minimum Sum Coloring Problem
Clément Lecat, Corinne Lucet, Chu-Min Li
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 |
|---|---|---|---|
| use independence number with major motifs (LBMSigma) instead of chromatic-number-only bound (LBKok) | MSCP lower bound · DSJC1000.5 | chromatic sum lower bound: 1105 -> 33835 | Improved |
| LBMSigma versus best known clique-partition lower bound | MSCP lower bound · DIMACS/COLOR 70 instances | chromatic sum lower bound | Mixed |
| LBMSigma versus best known lower bound | MSCP lower bound · myciel7 | chromatic sum lower bound: 286 -> 308 | Improved |
| LBMSigma versus best known lower bound | MSCP lower bound · DSJC1000.9 | chromatic sum lower bound: 26557 -> 85235 | Improved |
| LBMSigma versus clique-partition bound | MSCP lower bound · le450-5c | chromatic sum lower bound: 1278 -> 1350 | Improved |
Closest papers by meaning
- KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum k-Defective Clique Problem (AAAI 2024 · similarity 0.84)
- A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem (AAAI 2024 · similarity 0.83)
- The Query Complexity of Local Search in Rounds on General Graphs (NeurIPS 2026 · similarity 0.82)
- Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover (AAAI 2024 · similarity 0.81)
- On the Complexity of Finite-Sum Smooth Optimization under the Polyak–Łojasiewicz Condition (ICML 2024 · similarity 0.81)
- Discrepancy Minimization in Input-Sparsity Time (ICML 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.
