Pages that link to "Item:Q5395672"
From MaRDI portal
The following pages link to New Constructive Aspects of the Lovász Local Lemma (Q5395672):
Displaying 24 items.
- On the configuration-LP for scheduling on unrelated machines (Q490331) (← links)
- Nonrepetitive colouring via entropy compression (Q524188) (← links)
- On \((1, \epsilon )\)-restricted max-min fair allocation problem (Q724228) (← links)
- Strong LP formulations for scheduling splittable jobs on unrelated machines (Q896269) (← links)
- Restricted max-min allocation: integrality gap and approximation algorithm (Q2149096) (← links)
- Randomly coloring simple hypergraphs with fewer colors (Q2361498) (← links)
- Acyclic edge-coloring using entropy compression (Q2444732) (← links)
- Multistage online maxmin allocation of indivisible entities (Q2676469) (← links)
- An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles (Q4960448) (← links)
- Restricted Max-Min Fair Allocation (Q5002708) (← links)
- (Q5009540) (← links)
- (Q5091188) (← links)
- Counting Solutions to Random CNF Formulas (Q5096442) (← links)
- New bounds for the Moser‐Tardos distribution (Q5120743) (← links)
- Counting Hypergraph Colorings in the Local Lemma Regime (Q5232330) (← links)
- Lazy Local Search Meets Machine Scheduling (Q5237306) (← links)
- (Q5240417) (← links)
- A Local Lemma for Focused Stochastic Algorithms (Q5242924) (← links)
- Upper Bounds on the Size of Covering Arrays (Q5270407) (← links)
- Dynamic Sampling from Graphical Models (Q5858642) (← links)
- Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)
- Efficiently list‐edge coloring multigraphs asymptotically optimally (Q6052475) (← links)
- Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel (Q6076732) (← links)
- Online max-min fair allocation (Q6109544) (← links)