On the complexity of the parity argument and other inefficient proofs of existence
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
How to assemble tree machines (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Complexity results on a paint shop problem
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Journal of Algebraic Combinatorics: An International Journal
Algorithmic construction of sets for k-restrictions
ACM Transactions on Algorithms (TALG)
The Borsuk-Ulam-property, Tucker-property and constructive proofs in combinatorics
Journal of Combinatorial Theory Series A
Paintshop, odd cycles and necklace splitting
Discrete Applied Mathematics
Discrete Splittings of the Necklace
Mathematics of Operations Research
Greedy colorings for the binary paintshop problem
Journal of Discrete Algorithms
Complexity results on restricted instances of a paint shop problem for words
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Some heuristics for the binary paint shop problem and their expected number of colour changes
Journal of Discrete Algorithms
Hi-index | 0.01 |
How to assign colors to the occurrences of cars in a car factory? How to divide fairly a necklace between thieves who have stolen it? These two questions are addressed in two combinatorial problems that have attracted attention from a theoretical point of view these last years, the first one more by people from the combinatorial optimization community, the second more from the topological combinatorics and computer science point of view. The first problem is the paint shop problem, defined by Epping et al. (2004) [11]. Given a sequence of cars where repetition can occur, and for each car a multiset of colors where the sum of the multiplicities is equal to the number of repetitions of the car in the sequence, decide the color to be applied for each occurrence of each car so that each color occurs with the multiplicity that has been assigned. The goal is to minimize the number of color changes in the sequence. The second problem, highly related to the first one, takes its origin in a famous theorem found by Alon (1987) [1] stating that a necklace with t types of beads and qa"u occurrences of each type u (a"u is a positive integer) can always be fairly split between q thieves with at most t(q-1) cuts. An intriguing aspect of this theorem lies in the fact that its classical proof is completely non-constructive. Designing an algorithm that computes theses cuts is not an easy task, and remains mostly open. The main purpose of the present paper is to make a step in a more operational direction for these two problems by discussing practical ways to compute solutions for instances of various sizes. Moreover, it starts with an exhaustive survey on the algorithmic aspects of them, and some new results are proved.