{'fraction_non_alphanumeric': 0.018957345971563982, 'fraction_numerical': 0.00315955766192733, 'mean_word_length': 6.044444444444444, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Packing, Covering and Partitioning Problems with Strongly Unimodular Constraint Matrices

A 0-1 matrix A is called strongly unimodular if all its nonsingular square submatrices are triangular. We present an efficient algorithm for linear programming problems in binary variables, when all constraints are of the packing, covering or partitioning type, and the constraint matrix is strongly unimodular. The algorithm uses a certain decomposition of strongly unimodular matrices into their so-called “restricted unimodular” components, and an efficient optimization algorithm for linear programs with restricted unimodular constraints.