Pages that link to "Item:Q1761213"
From MaRDI portal
The following pages link to Computing solutions of the paintshop-necklace problem (Q1761213):
Displaying 7 items.
- Paintshop, odd cycles and necklace splitting (Q1028475) (← links)
- Complexity results on a paint shop problem. (Q1427181) (← links)
- Greedy versus recursive greedy: uncorrelated heuristics for the binary paint shop problem (Q1983103) (← links)
- (Q3550085) (← links)
- (Q4919208) (← links)
- The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich (Q5863324) (← links)
- Improved bounds for the binary paint shop problem (Q6591633) (← links)