2000 character limit reached
Partial order alignment by adjacencies and breakpoints
Published 6 Oct 2021 in cs.CC, cs.DM, and math.CO | (2110.02809v1)
Abstract: Linearizing two partial orders to maximize the number of adjacencies and minimize the number of breakpoints is APX-hard. This holds even if one of the two partial orders is already a linear order and the other is an interval order, or if both partial orders are weak orders.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.