Rank inequalities and separation algorithms for packing designs and sparse triple systems.

DOI10.1016/S0304-3975(02)00648-5zbMath1051.68143MaRDI QIDQ1401311

Lucia Moura

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

polytopescombinatorial designs

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (1)

Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities

Cites Work

• Coding techniques for handling failures in large disk arrays
• Cutting planes in combinatorics
• On the 0,1 facets of the set covering polytope
• A generalization of antiwebs to independence systems and their canonical facets
• Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration
• Anti-mitre Steiner triple systems
• On certain polytopes associated with graphs
• Asymptotically optimal erasure-resilient codes for large disk arrays.
• A direct product construction for 5-sparse triple systems
• Extremal problems for triple systems
• A small basis for four‐line configurations in steiner triple systems. Dedicated to the memory of gemma holly griggs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Rank inequalities and separation algorithms for packing designs and sparse triple systems.