Dependent Randomized Rounding: The Bipartite Case

DOI10.1137/1.9781611972917.10zbMath1430.68194OpenAlexW301249462MaRDI QIDQ5233703

Magnus Wahlström, Benjamin Doerr, Marvin Künnemann

Publication date: 12 September 2019

Published in: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Related Items (1)

Randomized Rounding in the Presence of a Cardinality Constraint

This page was built for publication: Dependent Randomized Rounding: The Bipartite Case