2 problems
- 0 votes0 replies0 views
XQAOA level-1 limiting performance conjecture for the Binary Paint Shop Problem
Consider Binary Paint Shop Problem instances encoded as Ising models, and let be the number of paint swaps. Let XQAOA denote the level-1 XQAOA ansatz, with its param…
- 0 votes0 replies0 views
Recursive-star greedy's asymptotic performance conjecture for the Binary Paint Shop Problem
Let be the number of cars in a Binary Paint Shop Problem instance, and let denote the number of paint swaps produced by a colouring algorithm. Write…