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

José D. P. Rolim, Luca Trevisan. A case study of de-randomization methods for combinatorial approximation algorithms. In Panos M. Pardalos, Ding-Zhu Du, editors, Network Design: Connectivity and Facilities Location, Proceedings of a DIMACS Workshop, Princetin, New Jersey, USA, April 28-30, 1997. Volume 40 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 319-334, DIMACS/AMS, 1997.

@inproceedings{RolimT97,
  title = {A case study of de-randomization methods for combinatorial approximation algorithms},
  author = {José D. P. Rolim and Luca Trevisan},
  year = {1997},
  researchr = {https://researchr.org/publication/RolimT97},
  cites = {0},
  citedby = {0},
  pages = {319-334},
  booktitle = {Network Design: Connectivity and Facilities Location, Proceedings of a DIMACS Workshop, Princetin, New Jersey, USA, April 28-30, 1997},
  editor = {Panos M. Pardalos and Ding-Zhu Du},
  volume = {40},
  series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
  publisher = {DIMACS/AMS},
}