Pages that link to "Item:Q2784473"
From MaRDI portal
The following pages link to New algorithmic aspects of the local lemma with applications to routing and partitioning (Q2784473):
Displaying 6 items.
- Approximation-Friendly Discrepancy Rounding (Q3186517) (← links)
- Conflict-Free Colourings of Graphs and Hypergraphs (Q3552506) (← links)
- (Q4471317) (← links)
- Partial Resampling to Approximate Covering Integer Programs (Q4575724) (← links)
- A (1 + ?)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lov�sz Local Lemma (Q4810508) (← links)
- Constraint satisfaction, packet routing, and the lovasz local lemma (Q5495839) (← links)