Pages that link to "Item:Q2266932"
From MaRDI portal
The following pages link to Greedy colorings for the binary paintshop problem (Q2266932):
Displaying 11 items.
- Greedy colorings of words (Q444455) (← links)
- Some heuristics for the binary paint shop problem and their expected number of colour changes (Q553962) (← links)
- Almost optimal solutions for bin coloring problems (Q941831) (← links)
- Paintshop, odd cycles and necklace splitting (Q1028475) (← links)
- Complexity results on a paint shop problem. (Q1427181) (← links)
- Computing solutions of the paintshop-necklace problem (Q1761213) (← links)
- Greedy versus recursive greedy: uncorrelated heuristics for the binary paint shop problem (Q1983103) (← links)
- The Approximability of the Binary Paintshop Problem (Q2851858) (← links)
- (Q3684143) (← links)
- (Q4919208) (← links)
- Algorithms and Computation (Q5897842) (← links)