1 problem

0 votes0 replies0 views
Recursive-star greedy's asymptotic performance conjecture for the Binary Paint Shop Problem
Let $n$ be the number of cars in a Binary Paint Shop Problem instance, and let $\Delta_C$ denote the number of paint swaps produced by a colouring algorithm. Write…
Conjectureopenapproximation-algorithms binary-paint-shop quantum-heuristicsarXiv posted 2 days ago

Recursive-star greedy's asymptotic performance conjecture for the Binary Paint Shop Problem