Fractional packing in ideal clutters (Q431029): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Fractional Packing of<i>T</i>-Joins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck extrema / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to make a digraph strongly connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Centroids, Representations, and Submodular Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing algorithms for arborescences (and spanning trees) in capacitated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Algorithm for Finding the Minimum Cut in a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for minimum cost arc-connectivity orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the width—length inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimax Theorem for Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to a conjecture of Edmonds and Giles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank

Revision as of 09:24, 5 July 2024

scientific article
Language Label Description Also known as
English
Fractional packing in ideal clutters
scientific article

    Statements

    Identifiers