Rank inequalities and separation algorithms for packing designs and sparse triple systems.
type: Item
instance of: scholarly article
title: Rank inequalities and separation algorithms for packing designs and sparse triple systems.
zbMATH Open document ID: 1051.68143
DOI: 10.1016/S0304-3975(02)00648-5
author: Lucia Moura
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 1965329
zbMATH Keywords: combinatorial designs
zbMATH Keywords: polytopes
MaRDI profile type: Publication
cites work: Q3892882
cites work: Q4143313
cites work: Q4398361
cites work: Asymptotically optimal erasure-resilient codes for large disk arrays.
cites work: On certain polytopes associated with graphs
cites work: Cutting planes in combinatorics
cites work: Anti-mitre Steiner triple systems
cites work: Q3745851
cites work: On the 0,1 facets of the set covering polytope
cites work: Q4240563
cites work: A small basis for four‐line configurations in steiner triple systems. Dedicated to the memory of gemma holly griggs
cites work: Q4500699
cites work: Coding techniques for handling failures in large disk arrays
cites work: A generalization of antiwebs to independence systems and their canonical facets
cites work: Extremal problems for triple systems
cites work: A direct product construction for 5-sparse triple systems
cites work: Q4026151
cites work: Q4884219
cites work: Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration
cites work: Q4938787
cites work: Q4508367
cites work: Q4876970
cites work: Q3722426
description: scientific article; zbMATH DE number 1965329