scientific article; zbMATH DE number 903456

DOI10.1002/(SICI)1098-2418(199605)8:3%3C161::AID-RSA1%3E3.0.CO;2-WMaRDI QIDQ4885222zbMATH OpenFDO

Authors Vojtěch Rödl, Luboš Thoma

Publication date 15 July 1996

Full work available at URL https://doi.org/10.1002/(SICI)1098-2418(199605)8:3%3C161::AID-RSA1%3E3.0.CO;2-W

zbMATH Keywords

hypergraphpackingrandom greedy algorithm

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Real time asymptotic packing
• On random greedy triangle packing
• Packing random graphs and hypergraphs
• A note on the random greedy independent set algorithm
• A note on the random greedy triangle-packing algorithm

Cited in

(25)

• Bin packing as a random walk: A note on Knödel's paper
• Fractional v. integral covers in hypergraphs of bounded edge size
• Nearly perfect matchings in regular simple hypergraphs
• On random greedy triangle packing
• Real time asymptotic packing
• Triangle-free subgraphs of hypergraphs
• On a conjecture of Erdős on locally sparse Steiner triple systems
• Random triangle removal
• A note on the random greedy independent set algorithm
• Nearly-perfect hypergraph packing is in NC
• Inapproximability of b-matching in k-uniform hypergraphs
• Random Covering and Packing on the Line
• Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics
• Disproof of a packing conjecture of Alon and Spencer
• A natural barrier in random greedy hypergraph matching
• The reverse \(H\)-free process for strictly 2-balanced graphs
• Packing random graphs and hypergraphs
• On the method of typical bounded differences
• On asymptotic packing of convex geometric and ordered graphs
• On the random greedy linear uniform hypergraph packing
• Graph and hypergraph colouring via nibble methods: a survey
• New bounds on the size of nearly perfect matchings in almost regular hypergraphs
• Threshold for Steiner triple systems
• Efficient polynomial-time approximation scheme for the genus of dense graphs
• High-girth Steiner triple systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4885222)