A short proof of the NP-completeness of minimum sum interval coloring
✍ Scribed by Dániel Marx
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 154 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0167-6377
No coin nor oath required. For personal study only.
✦ Synopsis
In the minimum sum coloring problem we have to assign positive integers to the vertices of a graph in such a way that neighbors receive different numbers and the sum of the numbers is minimized. Szkalicki has shown that minimum sum coloring is NP-hard for interval graphs. Here we present a simpler proof of this result.
📜 SIMILAR VOLUMES
A short proof is given of the fact that every graph has an interval representation of depth 2 in which each vertex u is represented by at most &f(u) + 11 intervals, except for an arbitrarily specified vertex w that appears left-most in the representation and is represented by at most [&d(w) + 1)1 in
Regional anesthesia for breast surgery may require a large amount of local anesthetic solution to provide an adequate blockade of all relevant structures. The purpose of this study was to determine the minimal volume of fluid required to anesthetize all nerves to adequately provide anesthesia for br