STOC 2000

Randomized metarounding (extended abstract)

Conference Paper Accepted Paper Algorithms and Complexity · Theoretical Computer Science

Abstract

No abstract is available in the live database for this paper.

Authors

Keywords

polyhedra
integrality gap
randomized rounding

Context

Venue: ACM Symposium on Theory of Computing
Archive span: 1969-2025
Indexed papers: 4364
Paper id: 333304876739142474