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

Dániel Marx (2005)

Details and statistics

DOI: 10.1016/J.ORL.2004.07.006

access: closed

type: Journal Article

metadata version: 2017-05-27

a service of  Schloss Dagstuhl - Leibniz Center for Informatics