scientific article
From MaRDI portal
Publication:3712127
zbMath0585.90066MaRDI QIDQ3712127
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
combinatorial optimizationHamiltonian cyclessurvey paperrandomized algorithmsperfect matchingaverage case analysistutorialmaximum matchingsprobabilistic approacheserror bound analysisgreedy- type algorithmsprobabilistic running time
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (2)
Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck ⋮ The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem
This page was built for publication: