A case study of de-randomization methods for combinatorial approximation algorithms

DOI10.1023/A:1009793909670zbMath0916.90230OpenAlexW1502201475MaRDI QIDQ1282206

Luca Trevisan, José D. P. Rolim

Publication date: 27 July 1999

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009793909670

zbMATH Keywords

coveringrandom walkspackingroutingrandomized roundingbounded independence techniqueconditional probabilities method

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

This page was built for publication: A case study of de-randomization methods for combinatorial approximation algorithms