On a generalization of iterated and randomized rounding

DOI10.1145/3313276.3316313zbMath1433.68608arXiv1811.01597OpenAlexW2963046017MaRDI QIDQ5212852

Nikhil Bansal

Publication date: 30 January 2020

Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.01597

zbMATH Keywords

approximation algorithmsrandomized roundingdependent roundingiterating rounding

Mathematics Subject Classification ID

Linear programming (90C05) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (2)

A Spectral Approach to Network Design ⋮ Discrepancy theory and related algorithms

This page was built for publication: On a generalization of iterated and randomized rounding