On randomizing two derandomized greedy algorithms

DOI10.4310/JOC.2010.v1.n3.a1zbMath1244.68084OpenAlexW2329544464MaRDI QIDQ547862

Prasad Tetali, Kevin P. Costello, Asaf Shapira

Publication date: 27 June 2011

Published in: Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4310/joc.2010.v1.n3.a1

zbMATH Keywords

randomized algorithmsapproximation algorithms, random graphs

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Randomized algorithms (68W20) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (1)

Solving the weighted MAX-SAT problem using the dynamic convexized method

This page was built for publication: On randomizing two derandomized greedy algorithms