Derandomization through approximation
From MaRDI portal
Publication:2817641
DOI10.1145/195058.195241zbMath1344.68276OpenAlexW2025526852MaRDI QIDQ2817641
Publication date: 1 September 2016
Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/195058.195241
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (4)
The probabilistic method yields deterministic parallel algorithms ⋮ Global and fixed-terminal cuts in digraphs ⋮ Beating the 2-approximation factor for global bicut ⋮ Approximating unweighted connectivity problems in parallel
This page was built for publication: Derandomization through approximation
