Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma

A. Czumaj, C. Scheideler, in:, SODA, 2000, pp. 30–39.

Download
OA 185.00 KB
URN
Conference Paper
Author
Publishing Year
Proceedings Title
SODA
Page
30--39
LibreCat-ID

Cite this

Czumaj A, Scheideler C. Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In: SODA.; 2000:30-39.
Czumaj, A., & Scheideler, C. (2000). Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In SODA (pp. 30–39).
@inbook{Czumaj_Scheideler_2000, title={Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma}, booktitle={SODA}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={30–39}}
Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” In SODA, 30–39, 2000.
A. Czumaj and C. Scheideler, “Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma,” in SODA, 2000, pp. 30–39.
Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” SODA. N.p., 2000. 30–39. Print.
Main File(s)
File Name
185.00 KB
Access Level
OA Open Access
Last Uploaded
2018-04-12T08:36:17Z


Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar