Pages that link to "Item:Q2492209"
From MaRDI portal
The following pages link to Complexity results on restricted instances of a paint shop problem for words (Q2492209):
Displaying 14 items.
- Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions (Q398878) (← links)
- Greedy colorings of words (Q444455) (← links)
- Complexity issues in vertex-colored graph pattern matching (Q533412) (← links)
- 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)
- Computing solutions of the paintshop-necklace problem (Q1761213) (← links)
- Greedy versus recursive greedy: uncorrelated heuristics for the binary paint shop problem (Q1983103) (← links)
- Arc-routing for winter road maintenance (Q2234739) (← links)
- Greedy colorings for the binary paintshop problem (Q2266932) (← links)
- The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich (Q5863324) (← links)
- On Covering Segments with Unit Intervals (Q5864214) (← links)
- (Q5881546) (← links)
- Improved bounds for the binary paint shop problem (Q6591633) (← links)
- Inference in balanced community modulated recursive trees (Q6632613) (← links)
