Stochastic analysis of greedy algorithms for the subset sum problem
type: Item
instance of: scholarly article
title: Stochastic analysis of greedy algorithms for the subset sum problem
zbMATH Open document ID: 0941.90064
author: Ulrich Pferschy
published in: CEJOR. Central European Journal of Operations Research
publication date: 1999-11-08T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 60C05
zbMATH DE Number: 1358230
zbMATH Keywords: subset sum problem
zbMATH Keywords: probabilistic analysis
zbMATH Keywords: expected solution value
MaRDI profile type: Publication
full work available at URL: cl.2007.732
OpenAlex ID: W2951146621
DOI: 10.1246/CL.2007.732
Recommended article: The probabilistic analysis of a greedy satisfiability algorithm
Recommended article: Q4411392
Recommended article: Q4363259
Recommended article: Q4353161
Recommended article: On the analysis of stochastic divide and conquer algorithms
Recommended article: The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem
Recommended article: Q4724418
Recommended article: Q3792480
Recommended article: A refined analysis of submodular greedy
Recommended article: On the power of random greedy algorithms
description: scientific article; zbMATH DE number 1358230