  We discuss an extension of matrix element plus parton shower merging at
leading and next-to-leading order. The algorithm does preserve inclusive cross
sections at the respective input order. This constraint avoids potentially
large logarithmic contributions, which would require approximate (N)NLO
contributions to cancel against.
