scientific article; zbMATH DE number 1445282

MaRDI QIDQ4952595zbMATH OpenFDO

Authors Artur Czumaj, Christian Scheideler

Publication date 5 February 2001

zbMATH Keywords

2-coloring uniform hypergraphsLovász local lemmapolynomial-time algorithm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma
• New constructive aspects of the Lovász local lemma
• An algorithmic approach to the Lovász local lemma. I
• Deterministic algorithms for the Lovász local lemma
• scientific article; zbMATH DE number 2079358

Cited in

(20)

• Hypergraph colouring and the Lovász local lemma
• Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring
• Measurable versions of the Lovász local lemma and measurable graph colorings
• The local cut lemma
• A sharper local lemma with improved applications
• A note on near-optimal coloring of shift hypergraphs
• Properly 2-Colouring Linear Hypergraphs
• An algorithmic approach to the Lovász local lemma. I
• A parallel algorithmic version of the local lemma
• Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma
• A (1 + ?)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lov�sz Local Lemma
• Improved bounds and algorithms for hypergraph 2-coloring
• Finding independent transversals efficiently
• Commutative algorithms approximate the LLL-distribution
• A general framework for hypergraph coloring
• On the algorithmic Lovász local lemma and acyclic edge coloring
• A constructive algorithm for the Lovász local lemma on permutations
• A polynomial time algorithm for checking 2-chromaticity for recursively constructed k-terminal hypergraphs
• A fast coloring oracle for average case hypergraphs
• Coloring and the Lovász local lemma

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 Q4952595)