2 search results - page 1 / 1 » Greedy colorings for the binary paintshop problem |
JDA
2010
13 years 4 months ago
2010
Cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color chan...
APPROX
2000
Springer
13 years 10 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...