AI Paper Atlas

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

AAAI 2017 · Learning theory and algorithms › Sample complexity · approach: Computational thresholds in graphs and structure · 11 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
use independence number with major motifs (LBMSigma) instead of chromatic-number-only bound (LBKok)MSCP lower bound · DSJC1000.5chromatic sum lower bound: 1105 -> 33835Improved
LBMSigma versus best known clique-partition lower boundMSCP lower bound · DIMACS/COLOR 70 instanceschromatic sum lower boundMixed
LBMSigma versus best known lower boundMSCP lower bound · myciel7chromatic sum lower bound: 286 -> 308Improved
LBMSigma versus best known lower boundMSCP lower bound · DSJC1000.9chromatic sum lower bound: 26557 -> 85235Improved
LBMSigma versus clique-partition boundMSCP lower bound · le450-5cchromatic sum lower bound: 1278 -> 1350Improved

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