Pages that link to "Item:Q2851858"
From MaRDI portal
The following pages link to The Approximability of the Binary Paintshop Problem (Q2851858):
Displaying 8 items.
- Some heuristics for the binary paint shop problem and their expected number of colour changes (Q553962) (← links)
- Paintshop, odd cycles and necklace splitting (Q1028475) (← links)
- Selecting and covering colored points (Q1801049) (← links)
- Greedy versus recursive greedy: uncorrelated heuristics for the binary paint shop problem (Q1983103) (← links)
- Greedy colorings for the binary paintshop problem (Q2266932) (← links)
- Complexity results on restricted instances of a paint shop problem for words (Q2492209) (← links)
- (Q4919208) (← links)
- On Covering Segments with Unit Intervals (Q5864214) (← links)