New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning

DOI10.1137/S0097539700379760zbMath0990.90077OpenAlexW2002658910WikidataQ124801186 ScholiaQ124801186MaRDI QIDQ2784473

No author found.

Publication date: 23 April 2002

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539700379760

zbMATH Keywords

integer programmingrandomized roundingLovász local lemmadisjoint paths

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (3)

Approximation-Friendly Discrepancy Rounding ⋮ Partial Resampling to Approximate Covering Integer Programs ⋮ Conflict-Free Colourings of Graphs and Hypergraphs

This page was built for publication: New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning