Clean clutters and dyadic fractional packings
DOI10.1137/21M1397325zbMATH Open1492.90144OpenAlexW4224232446MaRDI QIDQ5071103FDOQ5071103
Authors: Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel 
Publication date: 20 April 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/21m1397325
Recommendations
ideal clutterquasi-polynomial timecube-ideal setCarathéodory's theoremdyadic fractional packingprojective geometries over \(GF(2)\)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- Cuboids, a class of clutters
- Matching, Euler tours and the Chinese postman
- Title not available (Why is that?)
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A Solution of the Shannon Switching Game
- Bottleneck extrema
- A class of simple games
- Blocking and anti-blocking pairs of polyhedra
- The matroids with the max-flow min-cut property
- Ideal 0, 1 matrices
- Packing odd circuits in Eulerian graphs
- Combinatorial optimization. Packing and covering
- Title not available (Why is that?)
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- Packing odd T‐joins with at most two terminals
- The Cycling Property for the Clutter of Odd st-Walks
- The complexity of recognizing linear systems with certain integrality properties
- 2-Matchings and 2-covers of hypergraphs
- The Forbidden Minors of Binary Clutters
- Title not available (Why is that?)
- On the width-length inequality
- Resolution and the integrality of satisfiability problems
- \((0,\pm 1)\) ideal matrices
- Perfect and ideal \(0, \pm 1\) matrices
- Ideal clutters that do not pack
- The packing property.
- Intersecting restrictions in clutters
- Deltas, extended odd holes and their blockers
- Idealness of \(k\)-wise intersecting families
- Clean tangled clutters, simplices, and projective geometries
Cited In (7)
- Clean tangled clutters, simplices, and projective geometries
- On Packing Dijoins in Digraphs and Weighted Digraphs
- Total dual dyadicness and dyadic generating sets
- Fractional packing in ideal clutters
- Fractional packing in ideal clutters
- Total dual dyadicness and dyadic generating sets
- On dyadic fractional packings of \(T\)-joins
Uses Software
This page was built for publication: Clean clutters and dyadic fractional packings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5071103)
