Improved bounds for the binary paint shop problem

DOI10.1007/978-3-031-49193-1_16MaRDI QIDQ6591633zbMATH OpenFDO

Authors Jaroslav Hančl Jr., Adam Kabela, Michal Opler, Jakub Sosnovec, Robert Šámal, Pavel Valtr

Publication date 22 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-49193-1_16

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• Complexity results on a paint shop problem.
• Complexity results on restricted instances of a paint shop problem for words
• Computing solutions of the paintshop-necklace problem
• Greedy versus recursive greedy: uncorrelated heuristics for the binary paint shop problem
• Paintshop, odd cycles and necklace splitting
• Random interval graphs
• Some heuristics for the binary paint shop problem and their expected number of colour changes
• Splitting necklaces

This page was built for publication: Improved bounds for the binary paint shop problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6591633)