Greedy colorings for the binary paintshop problem

DOI10.1016/J.JDA.2008.05.002MaRDI QIDQ2266932zbMATH OpenOpenAlexFDO

Authors Hadis Amini, Frédéric Meunier, Héloïse Michel, Atefeh Mohajeri

Publication date 26 February 2010

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2008.05.002

zbMATH Keywords

greedy algorithmpaintshop problemprobabilistic bound

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Greedy colorings of words
• Some heuristics for the binary paint shop problem and their expected number of colour changes
• Paintshop, odd cycles and necklace splitting
• The Approximability of the Binary Paintshop Problem
• Greedy versus recursive greedy: uncorrelated heuristics for the binary paint shop problem

Cites work

• Complexity results on a paint shop problem.
• Complexity results on restricted instances of a paint shop problem for words
• Paintshop, odd cycles and necklace splitting

Cited in

(12)

• Greedy versus recursive greedy: uncorrelated heuristics for the binary paint shop problem
• Paintshop, odd cycles and necklace splitting
• scientific article; zbMATH DE number 6161631 (Why is no real title available?)
• Almost optimal solutions for bin coloring problems
• Complexity results on a paint shop problem.
• Computing solutions of the paintshop-necklace problem
• Algorithms and Computation
• Greedy colorings of words
• Some heuristics for the binary paint shop problem and their expected number of colour changes
• scientific article; zbMATH DE number 3906523 (Why is no real title available?)
• MaxFlow-MinCut duality for a paint shop problem
• The Approximability of the Binary Paintshop Problem

This page was built for publication: Greedy colorings for the binary paintshop problem

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