A short proof of the NP-completeness of minimum sum interval coloring

Dániel Marx. A short proof of the NP-completeness of minimum sum interval coloring. Oper. Res. Lett., 33(4):382-384, 2005. [doi]

Abstract

Abstract is missing.