On randomizing two derandomized greedy algorithms
type: Item
instance of: scholarly article
title: On randomizing two derandomized greedy algorithms
zbMATH Open document ID: 1244.68084
author: Kevin P. Costello
author: Asaf Shapira
author: Prasad Tetali
published in: Journal of Combinatorics
publication date: 2011-06-27T00:00:00Z
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 05D40
zbMATH DE Number: 5913528
zbMATH Keywords: randomized algorithms
zbMATH Keywords: approximation algorithms, random graphs
MaRDI profile type: Publication
full work available at URL: joc.2010.v1.n3.a1
OpenAlex ID: W2329544464
DOI: 10.4310/JOC.2010.V1.N3.A1
Recommended article: On the power of random greedy algorithms
Recommended article: On the greedy algorithm with random costs
Recommended article: Q5365069
Recommended article: A note on the random greedy independent set algorithm
Recommended article: Randomized and derandomized algorithms
Recommended article: Q4840773
Recommended article: On two random search problems
Recommended article: Q5009621
Recommended article: Randomized algorithms in combinatorial optimization: A survey
description: scientific article; zbMATH DE number 5913528