Computing an Evolutionary Ordering is Hard

Laurent Bulteau, Gustavo Sacomoto, Blerina Sinaimeri

We prove that computing an evolutionary ordering of a family of sets, i.e. an ordering where each set intersects with --but is not included in-- the union earlier sets, is NP-hard.