"A case study of de-randomization methods for combinatorial approximation ..."

José D. P. Rolim, Luca Trevisan (1997)

> Home

Details and statistics

DOI: 10.1090/DIMACS/040/19

access: closed

type: Conference or Workshop Paper

metadata version: 2022-06-09

- view
  authority control:
- export record
  dblp key:
  - conf/dimacs/RolimT97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dimacs/RolimT97
José D. P. Rolim, Luca Trevisan:
A case study of de-randomization methods for combinatorial approximation algorithms. Network Design: Connectivity and Facilities Location 1997: 319-334

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.