Zur Kurzanzeige

2005-11-07Buch DOI: 10.18452/2658
The average behaviour of greedy algorithms for the knapsack problem: General distributions
dc.contributor.authorDiubin, Gennady
dc.contributor.authorKorbut, Alexander
dc.date.accessioned2017-06-15T17:53:10Z
dc.date.available2017-06-15T17:53:10Z
dc.date.created2005-11-07
dc.date.issued2005-11-07none
dc.identifier.urihttp://edoc.hu-berlin.de/18452/3310
dc.description.abstractThis paper is a partial generalization of the results of [3] for rather arbitrary distributions of coefficients. We state the main theorem concerning the average behaviour of greedy algorithms. The validity of this theorem is implied by the validity of the Conditions 1 and 2 from [3]. We give a detailed proof of Condition 1. The characterization of distributions for which Condition 2 holds will be the subject of a forthcoming paper.eng
dc.language.isoeng
dc.publisherHumboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, Institut für Mathematik
dc.relation.ispartofseriesPreprints aus dem Institut für Mathematik - 19, Mathematik-Preprints, ISSN:0863-0976
dc.subjectknapsack problemseng
dc.subjectgreedy algorithmseng
dc.subjectaverage behavioureng
dc.subject.ddc510 Mathematik
dc.titleThe average behaviour of greedy algorithms for the knapsack problem: General distributions
dc.typebook
dc.identifier.urnurn:nbn:de:kobv:11-10052936
dc.identifier.doihttp://dx.doi.org/10.18452/2658
local.edoc.container-titlePreprints aus dem Institut für Mathematik
local.edoc.container-titleMathematik-Preprints
local.edoc.container-issn0863-0976
local.edoc.pages20
local.z-edoc.journal-periodikumAusgabe19,
local.edoc.type-nameBuch
local.edoc.container-typeseries
local.edoc.container-type-nameSchriftenreihe
local.edoc.container-volume2000
local.edoc.container-issue19
local.edoc.container-year2000

Zur Kurzanzeige