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

Dániel Marx (2005)

> Home

Details and statistics

DOI: 10.1016/J.ORL.2004.07.006

access: closed

type: Journal Article

metadata version: 2025-09-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/orl/Marx05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/orl/Marx05
Dániel Marx:
A short proof of the NP-completeness of minimum sum interval coloring. Oper. Res. Lett. 33(4): 382-384 (2005)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.